Computation theoretic aspects of cellular automata

[1]  E. F. Moore.  Machine Models of Self-Reproduction , 1962 .

[2]  J. Myhill.  The converse of Moore’s Garden-of-Eden theorem , 1963 .

[3]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[4]  Michael A. Arbib,et al.  Simple Self-Reproducing Universal Automata , 1966, Inf. Control..

[5]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[6]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[7]  Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Trans. Computers.

[8]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[9]  Alvy Ray Smith,et al.  Simple Computation-Universal Cellular Spaces , 1971, JACM.

[10]  R. Robinson.  Undecidability and nonperiodicity for tilings of the plane , 1971 .

[11]  Alvy Ray Smith,et al.  Real-Time Language Recognition by One-Dimensional Cellular Automata , 1972, J. Comput. Syst. Sci..

[12]  B. Weiss.  Subshifts of finite type and sofic systems , 1973 .

[13]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[14]  Tommaso Toffoli,et al.  Computation and Construction Universality of Reversible Cellular Automata , 1977, J. Comput. Syst. Sci..

[15]  P. Walters.  Introduction to Ergodic Theory , 1977 .

[16]  C. Conley.  Isolated Invariant Sets and the Morse Index , 1978 .

[17]  Maurice Nivat,et al.  Sur les ensembles de mots infins engendrés par une grammaire algébrique , 1978, RAIRO Theor. Informatics Appl..

[18]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[19]  Masayuki Kimura,et al.  Injectivity and Surjectivity of Parallel Maps for Cellular Automata , 1979, J. Comput. Syst. Sci..

[20]  Lutz Priese,et al.  Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines , 1979, SIAM J. Comput..

[21]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[22]  Charles R. Dyer,et al.  One-Way Bounded Cellular Automata , 1980, Inf. Control..

[23]  Hiroshi Umeo,et al.  Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems , 1982, Inf. Process. Lett..

[24]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[25]  Martin Gardner,et al.  Wheels, life, and other mathematical amusements , 1983 .

[26]  Stephen Wolfram,et al.  Universality and complexity in cellular automata , 1983 .

[27]  D. Lind.  Applications of ergodic theory and sofic systems to cellular automata , 1984 .

[28]  S. Wolfram.  Computation theory of cellular automata , 1984 .

[29]  Karel Culik,et al.  Iterative Tree Automata , 1984, Theor. Comput. Sci..

[30]  Danièle Beauquier.  Ensembles reconnaissables de mots bi -infinis limite et déterminisme , 1984, Automata on Infinite Words.

[31]  Karel Culik,et al.  Topological Transformations as a Tool in the Design of Systolic Networks , 1985, Theor. Comput. Sci..

[32]  S. Wolfram.  Twenty Problems in the Theory of Cellular Automata , 1985 .

[33]  Karel Culik,et al.  Translation of Systolic Algorithms between Systems of Different Topology , 1985, ICPP.

[34]  Jonathan D. Victor,et al.  Local structure theory for cellular automata , 1987 .

[35]  Lyman P. Hurd.  Formal Language Characterization of Cellular Automaton Limit Sets , 1987, Complex Syst..

[36]  Karel Culik,et al.  On Invertible Cellular Automata , 1987, Complex Syst..

[37]  Solomon W. Golomb,et al.  A New Result on Comma-Free Codes of Even Word-Length , 1987, Canadian Journal of Mathematics.

[38]  R. Gilman.  Classes of linear automata , 1987, Ergodic Theory and Dynamical Systems.

[39]  Karel Culik,et al.  A Simple Universal Cellular Automaton and its One-Way and Totalistic Version , 1987, Complex Syst..

[40]  Frederic Green,et al.  NP-Complete Problems in Cellular Automata , 1987, Complex Syst..

[41]  Lyman Porter Hurd.  The application of formal language theory to the dynamical behavior of cellular automata , 1988 .

[42]  Robert H. Gilman,et al.  Periodic behavior of linear automata , 1988 .

[43]  Carter Bays.  Classification of Semitotalistic Cellular Automata in Three Dimensions , 1988, Complex Syst..

[44]  Karel Culik,et al.  Undecidability of CA Classification Schemes , 1988, Complex Syst..

[45]  Lyman P. Hurd.  The Non-wandering Set of a CA Map , 1988, Complex Syst..

[46]  Karel Culik,et al.  On Totalistic Systolic Networks , 1988, Inf. Process. Lett..

[47]  Klaus Sutner.  The Computational Complexity of Cellular Automata , 1989, FCT.

[48]  Klaus Sutner,et al.  A Note on Culik-Yu Classes , 1989, Complex Syst..

[49]  Antonio Restivo.  Finitely Generated Sofic Systems , 1989, Theor. Comput. Sci..

[50]  Karel Culik,et al.  On the Limit Sets of Cellular Automata , 1989, SIAM J. Comput..

[51]  K. Culík,et al.  Formal languages and global cellular automaton behavior , 1991 .

[52]  H. Gutowitz.  A hierarchical classification of cellular automata , 1991 .