Procedures for calculating reversible one-dimensional cellular automata-Reference-Cited by-同舟云学术

Procedures for calculating reversible one-dimensional cellular automata

Published:2005-03 Issue:1-2 Volume:202 Page:134-141
ISSN:0167-2789
Container-title:Physica D: Nonlinear Phenomena
language:en
Short-container-title:Physica D: Nonlinear Phenomena

Author:

Seck Tuoh Mora Juan Carlos,Chapa Vergara Sergio V.,Juárez Martínez Genaro,McIntosh Harold V.

Publisher

Elsevier BV

Subject

Condensed Matter Physics,Statistical and Nonlinear Physics

Reference18 articles.

1. Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures;Amoroso;J. Comput. Syst. Sci.,1972

2. Combinatorial construction of one-dimensional reversible cellular automata;Boykett;Contrib. Gen. Algebra,1994

3. T. Boykett, Efficient exhaustive listings of reversible one dimensional cellular automata, 1997. Available in http://www.algebra.uni-linz.ac.at/~tim/enumeration.ps.gz.

4. The fantastic combinations of John Conway’s new solitaire game “Life”;Gardner;Sci. Am.,1970

5. Endomorphisms and automorphisms of the shift dynamical system;Hedlund;Math. Syst. Theory,1969

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief notes and history of computing in Mexico during 50 years;International Journal of Parallel, Emergent and Distributed Systems;2019-04-24

2. 2D Triangular von Neumann Cellular Automata with Periodic Boundary;International Journal of Bifurcation and Chaos;2019-03

4. Reversible Cellular Automata;Cellular Automata;2018

5. Reversible Cellular Automata;Encyclopedia of Complexity and Systems Science;2018