Automorphisms of transition graphs for elementary cellular automata

Journal of Cellular Automata

Volumn 4, Issue 2, 2009, Pages 125-135

  Powley, Edward J ^a   Stepney, Susan ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Automorphisms; Classification; Elementary cellular automata; Symmetry; Transition graphs

Indexed keywords

EID: 77952566933     PISSN: 15575969     EISSN: 15575977     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. Matthew Cook. Universality in elementary cellular automata. Complex Systems 15(1) (2004),1-40.
2. Frank Harary. Graph Theory. Addison-Wesley, 1969.
3. Chris G. Langton. Computation at the edge of chaos: Phase transitions and emergent computation. Physica D 42 (1990), 12-37.
4. Norman H. Packard and Stephen Wolfram. Two-dimensional cellular automata. Journal of Statistical Physics 38(5) (March 1985), 901-946.
5. Stephen Wolfram. Statistical mechanics of cellular automata. Reviews of Modern Physics 55(3) (July 1983), 601-644.
6. Stephen Wolfram. Universality and complexity in cellular automata. Physica D 10 (1984), 1-35.
7. Stephen Wolfram. Random sequence generation by cellular automata. Advances in Applied Mathematics 7 (1986), 123-169.
8. Stephen Wolfram, editor. Theory and Applications of Cellular Automata. World Scientific, 1986.
9. Stephen Wolfram. Cellular Automata and Complexity: Collected Papers. Westview Press, 1994.
10. Andrew Wuensche. Attractor basins of discrete networks. D.Phil thesis, University of Sussex, 1997.