Self-stabilization of Circular Arrays of Automata
Leonid A. Levin

TL;DR
This paper strengthens previous results by explicitly proving that a small minority of automata in a finite circular array of simple two-state cellular automata will eventually vanish, demonstrating self-stabilization.
Contribution
It explicitly proves that a small minority of states in finite circular arrays of automata will disappear, extending prior infinite array results.
Findings
Small minority states vanish in finite circular arrays
Self-stabilization occurs in finite automata arrays
Strengthens previous infinite array results
Abstract
[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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Quasicrystal Structures and Properties · Modular Robots and Swarm Intelligence
