Linear cellular automata and Fischer automata

Parallel Computing

Volumn 23, Issue 11, 1997, Pages 1613-1634

  Sutner, Klaus ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Cellular automata; Minimal automata; Permutation automata

Indexed keywords

COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS;

FISCHER AUTOMATA; LINEAR CELLULAR AUTOMATA; PERMUTATION AUTOMATON;

FINITE AUTOMATA;

EID: 0031269938     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(97)00080-x     Document Type: Article

References (27)

1. S. Amoroso, Y.N. Patt, Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures, Journal of Computer and Systems Sciences 6 (1972) 448-464.
2. D. Beauquier, Minimal automaton for a factorial, transitive, rational language, Theoretical Computer Science 67 (1989) 65-73.
3. R. Fischer, Sofic systems and graphs, Monatshefte für Mathematik 80 (1975) 179-186.
4. G.A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory 3 (1969) 320-375.
5. W.M.L. Holcombe, Algebraic Automata Theory, Cambridge University Press, 1982.
6. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.
7. L. Hurd, Formal language characterizations of cellular automata limit sets, Complex Systems 1(1) (1987) 69-80.
8. K. Culik II, L.P. Hurd, S. Yu, Formal languages and global cellular automata behavior, Physica D 45 (1990) 396-403.
9. K. Culik II, Yu. Sheng, Undecidability of CA classification schemes, Complex Systems 2 (2) (1988) 177-190.
10. K. Culik II, Yu. Sheng, Cellular automata, regular sets, and sofic systems, Discrete Applied Mathematics 32 (1991) 85-101.
11. D. Landaeta, K. Sutner, The size of power automata (1994) (in preparation).
12. C.G. Langton, Studying artificial life with cellular automata, Physica D 22 (1986) 120-149.
13. C.G. Langton, Computation at the edge of chaos, Physica D 42 (1990) 12-37.
14. C.G. Langton, Life at the edge of chaos, in: C.G. Langton (Ed.), Artficial Life II, Santa Fe Institute, 1991, pp. 41-91.
15. W. Li, N. Packard, Structure of elementary cellular automata rule space, Complex Systems 4 (3) (1990) 281-298.
16. M. Mitchel, J.P. Crutchfield, P.T. Hraber, Dynamics, computation, and the 'Edge of Chaos': A re-examination, Technical report 93-06-040, Santa Fe Institute, New Mexico 87501, 1993.
17. M. Nasu, Homomorphisms of graphs and their global maps, in: N. Saito, T. Nishiziki (Eds.), Graph Theory and Algorithms, Springer-Verlag, LNCS 108, 1981, pp. 159-170.
18. D. Perrin, Finite automata, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, 1990, pp. 2-57.
19. J.E. Pin, Varieties of Formal Languages, Foundations of Computer Science, Plenum Publishing Corporation, 1986.
20. K. Sutner, A note on Culik-Yu classes, Complex Systems 3 (1) (1989) 107-115.
21. K. Sutner, Classifying circular cellular automata, Physica D 45 (1-3) (1990) 386-395.
22. K. Sutner, de Bruijn graphs and linear cellular automata, Complex Systems 5 (1) (1991) 19-30.
23. B. Weiss, Subshifts of finite type and sofic systems, Monatshefte für Mathematik 77 (1973) 462-474.
24. S. Wolfram, Computation theory of cellular automata, Communications in Mathematical Physics 96 (1) (1984) 15-57.
25. S. Wolfram, Universality and complexity in cellular automata, Physica D 10 (1984) 1-35.
26. S. Wolfram, Twenty problems in the theory of cellular automata, Physica Scripta T 9 (1985) 170-183.
27. S. Wolfram, Theory and Applications of Cellular Automata, World Scientific, 1986.