Universality of Cellular Automata

[1]  Maurice Margenstern,et al.  A universal cellular automaton in the hyperbolic plane , 2003, Theor. Comput. Sci..

[2]  Nicolas Ollinger,et al.  The Quest for Small Universal Cellular Automata , 2002, ICALP.

[3]  Klaus Sutner,et al.  Universality and Cellular Automata , 2004, MCU.

[4]  K. Morita,et al.  Computation universality of one-dimensional reversible (injective) cellular automata , 1989 .

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

[6]  E. F. Codd,et al.  Cellular automata , 1968 .

[7]  Jacques Mazoyer.  Computations on one-dimensional cellular automata , 2005, Annals of Mathematics and Artificial Intelligence.

[8]  Tommaso Toffoli,et al.  Cellular automata machines - a new environment for modeling , 1987, MIT Press series in scientific computation.

[9]  Jérôme Olivier Durand-Lose.  Reversible space-time simulation of cellular automata , 2000, Theor. Comput. Sci..

[10]  Zizhu Wang,et al.  Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours , 2007, Fundam. Informaticae.

[11]  Maurice Margenstern.  An Algorithm for Buiding Inrinsically Universal Automata in Hyperbolic Spaces , 2006, FCS.

[12]  Eric Goles,et al.  Q2r+Q2r As A Universal Billiard , 1992 .

[13]  Kenichi Morita,et al.  Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata , 1992, Inf. Process. Lett..

[14]  Jérôme Olivier Durand-Lose.  Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton , 1997, STACS.

[15]  Véronique Terrier,et al.  Signals in One-Dimensional Cellular Automata , 1999, Theor. Comput. Sci..

[16]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

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

[18]  Jérôme Durand-Lose,et al.  Computing Inside the Billiard Ball Model , 2002, Collision-Based Computing.

[19]  Palash Sarkar,et al.  A brief history of cellular automata , 2000, CSUR.

[20]  Matthew Cook,et al.  Universality in Elementary Cellular Automata , 2004, Complex Syst..

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

[22]  Kenichi Morita,et al.  Reversible Simulation of One-Dimensional Irreversible Cellular Automata , 1995, Theor. Comput. Sci..

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

[24]  Hidenosuke Nishio,et al.  Changing the Neighborhood of Cellular Automata , 2007, MCU.

[25]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[26]  Jarkko Kari,et al.  Theory of cellular automata: A survey , 2005, Theor. Comput. Sci..

[27]  Nicolas Ollinger.  Two-States Bilinear Intrinsically Universal Cellular Automata , 2001, FCT.

[28]  Nicolas Ollinger.  The Intrinsic Universality Problem of One-Dimensional Cellular Automata , 2003, STACS.

[29]  Jean-Christophe Dubacq.  How to Simulate Turing Machines by Invertible One-Dimensional Cellular Automata , 1995, Int. J. Found. Comput. Sci..

[30]  Mats G. Nordahl,et al.  Universal Computation in Simple One-Dimensional Cellular Automata , 1990, Complex Syst..

[31]  Norman Margolus,et al.  Universal Cellular Automata Based on the Collisions of Soft Spheres , 2008, Collision-Based Computing.

[32]  Jérôme Olivier Durand-Lose.  Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata , 1995, LATIN.

[33]  D. Richardson,et al.  Tessellations with Local Transformations , 1972, J. Comput. Syst. Sci..

[34]  Turlough Neary,et al.  P-completeness of Cellular Automaton Rule 110 , 2006, ICALP.

[35]  G. A. Hedlund.  Endomorphisms and automorphisms of the shift dynamical system , 1969, Mathematical systems theory.

[36]  Véronique Terrier.  Language not Recognizable in Real Time by One-Way Cellular Automata , 1996, Theor. Comput. Sci..

[37]  Zsuzsanna Róka.  Simulations between Cellular Automata on Cayley Graphs , 1999, Theor. Comput. Sci..

[38]  Kenneth Steiglitz,et al.  Embedding Computation in One-Dimensional Automata by Phase Coding Solitons , 1988, IEEE Trans. Computers.

[39]  Edwin Roger Banks.  Universality in Cellular Automata , 1970, SWAT.

[40]  Nicolas Ollinger,et al.  A Particular Universal Cellular Automaton , 2008, CSP.

[41]  Ivan Rapaport,et al.  Inducing an Order on Cellular Automata by a Grouping Operation , 1998, Discret. Appl. Math..

[42]  Arthur W. Burks,et al.  Essays on cellular automata , 1970 .

[43]  K. Culík,et al.  Computation theoretic aspects of cellular automata , 1990 .

[44]  Andrew Adamatzky.  Collision-Based Computing , 2002, Springer London.

[45]  Bruno Martin,et al.  A Universal Cellular Automaton in Quasi-Linear Time and its S-m-n Form , 1994, Theor. Comput. Sci..