Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
Ininvertible cellular automata: a review
Physica D
Decidability for some problems of linear cellular automata over finite commutative rings
Information Processing Letters
Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
Reversible simulation of one-dimensional irreversible cellular automata
Theoretical Computer Science
Invertible linear cellular automata over Zm: algorithmic and dynamical aspects
Journal of Computer and System Sciences
On the circuit depth of structurally reversible cellular automata
Fundamenta Informaticae - Special issue dedicated to A. Salomaa
Global Properties of 2D Cellular Automata: Some Complexity Results
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Linear Cellular Automata with Multiple State Variables
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Logical reversibility of computation
IBM Journal of Research and Development
Tessellations with local transformations
Journal of Computer and System Sciences
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
Journal of Computer and System Sciences
A tight linear bound on the neighborhood of inverse cellular automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Reversible cellular automata (RCA) are models of massively parallel computation that preserve information. This paper is a short survey of research on reversible cellular automata over the past fourty plus years. We discuss the classic results by Hedlund, Moore and Myhill that relate injectivity, surjectivity and reversibility with each other. Then we review algorithmic questions and some results on computational universality. Finally we talk about local reversibility vs. global reversibility.