Bulking II: Classifications of cellular automata
Authors:
- 1 July 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (30) , 3881-3905
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Bulking I: An abstract theory of bulkingTheoretical Computer Science, 2011
- Computational Irreducibility and the Predictability of Complex Physical SystemsPhysical Review Letters, 2004
- Intrinsic universality of a 1-dimensional reversible Cellular Automaton1997
- Firing squad synchronization problem in reversible cellular automataTheoretical Computer Science, 1996
- On the limit set of some universal cellular automataTheoretical Computer Science, 1993
- Particlelike structures and their interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular-automaton rulesPhysical Review A, 1991
- On the Limit Sets of Cellular AutomataSIAM Journal on Computing, 1989
- Classes of linear automataErgodic Theory and Dynamical Systems, 1987
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structuresJournal of Computer and System Sciences, 1972
- Endomorphisms and automorphisms of the shift dynamical systemTheory of Computing Systems, 1969