Representation of reversible cellular automata with block permutations
Author:
- 1 February 1996
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 29 (1) , 47-61
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Reversibility and surjectivity problems of cellular automataJournal of Computer and System Sciences, 1994
- Symbolic Dynamics and Matrices1993
- Invertible cellular automata: A reviewPhysica D: Nonlinear Phenomena, 1990
- Reversible parallel computation: An evolving space-modelTheoretical Computer Science, 1990
- Eventual extensions of finite codesProceedings of the American Mathematical Society, 1988
- Physics-like models of computationPhysica D: Nonlinear Phenomena, 1984
- Bicontinuous extensions of invertible combinatorial functionsTheory of Computing Systems, 1981
- Classification of Subshifts of Finite TypeAnnals of Mathematics, 1973
- Tessellations with local transformationsJournal of Computer and System Sciences, 1972
- Endomorphisms and automorphisms of the shift dynamical systemTheory of Computing Systems, 1969