Model checking one-dimensional cellular automata

Journal of Cellular Automata

Volumn 4, Issue 3, 2009, Pages 213-224

  Sutner, Klaus ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Cellular automaton; Decidability; First order logic; First order spectra; Model checking

Indexed keywords

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

References (16)

1. S. Amoroso and Y. N. Patt. Decision procedures for surjectivity and injectivity of paral- lel maps for tesselation structures. Journal of Computer and Systems Sciences 6 (1972), 448-464.
2. J. R. Büchi. Weak second-order arithemtic and finite automata. Z. Math. Logik and Grundl. Math. 6 (1960), 66-92.
3. J. R. Büchi. On a decision method in restricted second-order arithemtic. In Logic, Methodology and Philosophy of Science, Proc. 1960 Internat. Congr., 1962, pp. 1-11.
4. Edmund Clarke, Orna Grumberg, and Doron Peled. Model Checking. MIT Press, 2000.
5. K. Culik. Global cellular automata. Complex Systems 9 (1995), 251-266.
6. K. Culik and Sheng Yu. Cellular automata, ωω-regular sets, and sofic systems. Discrete Applied Mathematics 32 (1991), 85-101.
7. M. Huth and M. Ryan. Logicin Computer Science: Modelling and Reasoning about Systems. Cambridge UP, 2000.
8. J. Kari. Reversibility of 2D cellular automata is undecidable. PhysicaD 45(1990), 397-385.
9. O. Kupferman. Avoiding determinization. In Proceedings of the 21st IEEE Symp. on Logic in Computer Science, 2006.
10. M. Nivat and D. Perrin. Ensembles reconnaisable de mots biinfinis. Canad. J. Math. 38 (1986),513-537.
11. D. Perrin and J.-E. Pin. Infinite Words, vol. 141 of Pure and Applied Math. Elsevier, 2004.
12. S. Safra. On the complexity of ω-automata. In Proceedings of the 29th FOCS, IEEE Computer Soc. Press, 1988, pp. 319-327.
13. K. Sutner. A note on Culik-Yu classes. Complex Systems 3(1) (1989), 107-115.
14. K. Sutner. Classifying circular cellular automata. Physica D 45(1-3) (1990), 386-395.
15. K. Sutner. De Bruijn graphs and linear cellular automata. Complex Systems 5(1) (1991), 19-30.
16. K. Sutner. The size of power automata. In J. Sgall, Ales Pultr, and Petr Kolman, editors, Mathematical Foundations of Computer Science, vol. 2136 of SLNCS, 2001, pp. 666-677.