Dynamics groups of asynchronous cellular automata

Dynamics groups of asynchronous cellular automata,10.1007/s10801-010-0231-y,Journal of Algebraic Combinatorics,Matthew Macauley,Jon McCammond,Henning

Dynamics groups of asynchronous cellular automata   (Citations: 4)
BibTex | RIS | RefWorks Download
We say that a finite asynchronous cellular automaton (or more generally, any sequential dynamical system) is π-independent if its set of periodic points are independent of the order that the local functions are applied. In this case, the local functions permute the periodic points, and these permutations generate the dynamics group. We have previously shown that exactly 104 of the possible cellular automaton rules are π-independent. In the article, we classify the periodic states of these systems and describe their dynamics groups, which are quotients of Coxeter groups. The dynamics groups provide information about permissible dynamics as a function of update sequence and, as such, connect discrete dynamical systems, group theory, and algebraic combinatorics in a new and interesting way. We conclude with a discussion of numerous open problems and directions for future research.
Journal: Journal of Algebraic Combinatorics - J ALGEBR COMB , vol. 33, no. 1, pp. 11-35, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: