Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Mora, J. C.; Martinez, G. J.; McIntosh, H. V.
Languages: English
Types: Unknown

Classified by OpenAIRE into

arxiv: Nonlinear Sciences::Cellular Automata and Lattice Gases, Computer Science::Formal Languages and Automata Theory
We present the basic properties of reversible one-dimensional cellular automata equivalent by permutations with the full shift, this work only takes reversible automata of neighborhood size 2. In these cases, we prove that the evolution rule defining the temporal behavior of the automaton may specify the spacial behavior as well. Based on this result we present a procedure for constructing configurations with a predefined dynamical behavior. Some examples of these results are presented.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [2] J. de Vries. Elements of topological dynamics, volume 257 of Mathematics and its applications. Kluwer Academic Publishers, The Netherlands, 1993.
    • [3] Martin Gardner. The fantastic combinations of John Conway's new solitaire game “ Life ”. Scientific American, 223(4):120-123, 1970.
    • [4] G. A. Hedlund. Endomorphisms and automorphisms of the shift dynamical system. Mathematical Systems Theory, 3:320-375, 1969.
    • [5] Jarkko J. Kari. Representation of reversible cellular automata with block permutations. Mathematical Systems Theory, 29:47-61, 1996.
    • [6] Bruce P. Kitchens. Symbolic Dynamics One-sided Two-sided and Countable Markov Shifts. SpringerVerlag, 1998.
    • [7] Douglas Lind and Brian Marcus. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 1995.
    • [8] Masakazu Nasu. Local maps inducing surjective global maps of one dimensional tesellation automata. Mathematical Systems Theory, 11:327-351, 1978.
    • [9] Clark Robinson. Dynamical Systems: stability, symbolic dynamics, and chaos. CRC Press, Inc., 1995.
    • [10] Tommaso Toffoli and Norman Margolus. Cellular Automata Machines. MIT Press, London, 1987.
    • [11] Tommaso Toffoli and Norman Margolus. Invertible cellular automata: a review. In Howard A. Gutowitz, editor, Cellular Automata, Theory and Experiment, pages 229-253. MIT/North-Holland, 1991.
    • [12] John von Neumann. Theory of Self-Reproducing Automata. University of Illinois Press, Urbana and London, 1966. edited by Arthur W. Burks.
    • [13] S. Wolfram, editor. Theory and Applications of Cellular Automata. World Scientific, Singapore, 1986.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article