论文信息 - The structure of reversible one-dimensional cellular automata

The structure of reversible one-dimensional cellular automata

Abstract An algorithm is presented for determining reversibility characteristics of 1-dimensional cellular automaton laws. The concept of local reversibility is defined. Each locally reversible automaton is shown to be isomorphic to a member of the class of “center-reversible” automata. Algorithms are described for generating the set of center-reversible laws and the set of center-reversible additive laws.

David Hillman

[1] N. Margolus. Physics-like models of computation☆ , 1984 .

[2] A. Odlyzko,et al. Algebraic properties of cellular automata , 1984 .

[3] Serafino Amoroso,et al. Some Comments on Neighborhood Size for Tessellation Automata , 1972, Inf. Control..

[4] Masayuki Kimura,et al. Condition for Injectivity of Global Maps for Tessellation Automata , 1976, Inf. Control..

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

[6] Michael S. Waterman,et al. Some applications of information theory to cellular automata , 1984 .

[7] Serafino Amoroso,et al. Structural and Behavioral Equivalences of Tessellation Automata , 1971, Inf. Control..

[8] Burton Voorhees. Entropy of additive cellular automata , 1989 .

[9] G. Vichniac. Simulating physics with cellular automata , 1984 .

[10] R. W. Gerling. Classification of triangular and honeycomb cellular automata , 1990 .

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

[12] Nobuyasu Osato,et al. Linear Cellular Automata over Z_m , 1983, J. Comput. Syst. Sci..

[13] Stephen Wolfram,et al. Theory and Applications of Cellular Automata , 1986 .

[14] Puhua Guan,et al. Exact results for deterministic cellular automata with additive rules , 1986 .

[15] Serafino Amoroso,et al. Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures , 1972, J. Comput. Syst. Sci..