Self-stabilization of Circular Arrays of Automata
<|reference_start|>Self-stabilization of Circular Arrays of Automata: [Gacs, Kurdiumov, Levin, 78] proposed simple one-dimensional cellular automata with 2 states. In an infinite array they are self-stabilizing: if all but a finite minority of automata are in the same state, the minority states disappear. Implicit in the paper was a stronger result that a sufficiently small minority of states vanish even in a finite circular array. The following note makes this strengthening explicit.<|reference_end|>
@article{levin2006self-stabilization,
    title={Self-stabilization of Circular Arrays of Automata},
    author={Leonid A. Levin},
    journal={Theoretical Computer Science, 235(1):143-144, 2000},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0602033},
    primaryClass={cs.DC cs.DM}
}