Self-stabilization of Circular Arrays of Automata

Details Self-stabilization of Circular Arrays of Automata Self-stabilization of Circular Arrays of Automata

2006-02-09

arxiv.org/abs/cs/0602033v1

Theoretical Computer Science, 235(1):143-144, 2000

Computer Science

Distributed, Parallel, and Cluster Computing

2 pages

Scientific paper

[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.

Affiliated with

Also associated with

No associations

Rating

Self-stabilization of Circular Arrays of Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-stabilization of Circular Arrays of Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-stabilization of Circular Arrays of Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568053