Glossary
- Cellular Automaton:
-
A cellular automaton (CA) is a system consisting of a large (theoretically, infinite) number of finite automata, called cells, which are connected uniformly in a space. Each cell changes its state depending on the states of itself and the cells in its neighborhood. Thus, the state transition of a cell is specified by a local function. Applying the local function to all the cells in the space synchronously, the transition of a configuration (i.e., a whole state of the cellular space) is induced. Such a transition function is called a global function. A CA is regarded as a kind of dynamical system that can deal with various kinds of spatiotemporal phenomena.
- Cellular Automaton with Block Rules:
-
A CA with block rules was proposed by Margolus (1984), and it is often called a CA with Margolus neighborhood. The cellular space is divided into infinitely many blocks of the same size (in the two-dimensional case, e.g., 2 × 2). A local transition function consisting...
Bibliography
Primary Literature
Amoroso S, Cooper G (1970) The Garden of Eden theorem for finite configurations. Proc Amer Math Soc 26:158–164
Amoroso S, Patt Y-N (1972) Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J Comput Syst Sci 6:448–464
Bennett C-H (1973) Logical reversibility of computation. IBM J Res Dev 17:525–532
Bennett C-H (1982) The thermodynamics of computation – a review. Int J Theoret Phys 21:905–940
Bennett C-H, Landauer R (1985) The fundamental physical limits of computation. Sci Am 253:38–46
Boykett T (2004) Efficient exhaustive listings of reversible one dimensional cellular automata. Theoret Comput Sci 325:215–247
Cocke J, Minsky M (1964) Universality of tag systems with P = 2. J ACM 11:15–20
Cook M (2004) Universality in elementary cellular automata. Complex Syst 15:1–40
Fredkin E, Toffoli T (1982) Conservative logic. Int J Theoret Phys 21:219–253
Gruska J (1999) Quantum computing. McGraw-Hill, London
Hedlund G-A (1969) Endomorphisms and automorphisms of the shift dynamical system. Math Syst Theory 3:320–375
Imai K, Hori T, Morita K (2002) Self-reproduction in three-dimensional reversible cellular space. Artif Life 8:155–174
Imai K, Morita K (1996) Firing squad synchronization problem in reversible cellular automata. Theoret Comput Sci 165:475–482
Imai K, Morita K (2000) A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theoret Comput Sci 231:181–191
Kari J (1994) Reversibility and surjectivity problems of cellular automata. J Comput Syst Sci 48:149–182
Kari J (1996) Representation of reversible cellular automata with block permutations. Math Syst Theory 29:47–61
Landauer R (1961) Irreversibility and heat generation in the computing process. IBM J Res Dev 5:183–191
Langton C-G (1984) Self-reproduction in cellular automata. Physica D 10:135–144
Margolus N (1984) Physics-like model of computation. Phys D 10:81–95
Maruoka A, Kimura M (1976) Condition for injectivity of global maps for tessellation automata. Inf Control 32:158–162
Maruoka A, Kimura M (1979) Injectivity and surjectivity of parallel maps for cellular automata. J Comput Syst Sci 18:47–64
Minsky M-L (1967) Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs
Moore E-F (1962) Machine models of self-reproduction. Proc Symp Appl Math Am Math Soc 14:17–33
Mora J-C-S-T, Vergara S-V-C, Martinez G-J, McIntosh H-V (2005) Procedures for calculating reversible one-dimensional cellular automata. Physica D 202:134–141
Morita K (1990) A simple construction method of a reversible finite automaton out of Fredkin gates, and its related problem. Trans IEICE Jpn E-73:978–984
Morita K (1995) Reversible simulation of one-dimensional irreversible cellular automata. Theoret Comput Sci 148:157–163
Morita K (1996) Universality of a reversible two-counter machine. Theoret Comput Sci 168:303–320
Morita K (2001) A simple reversible logic element and cellular automata for reversible computing. In: Margenstern M, Rogozhin Y (eds), Proceedings of the MCU 2001. LNCS 2055, pp 102–113
Morita K (2007) Simple universal one-dimensional reversible cellular automata. J Cell Autom 2:159–166
Morita K 2008) Reversible computing and cellular automata – a survey. Theoret Comput Sci 395:101–131
Morita K (2011) Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata. Theoret Comput Sci 412:3856–3865
Morita K (2016a) An 8-state simple reversible triangular cellular automaton that exhibits complex behavior. In: Cook M, Neary T (eds) AUTOMATA 2016. LNCS 9664, pp 170–184. Slides with movies of computer simulation: Hiroshima University Institutional Repository. http://ir.lib.hiroshima-u.ac.jp/00039321
Morita K (2016b) Universality of 8-state reversible and conservative triangular partitioned cellular automaton. In: El Yacoubi S, et al (eds) ACRI 2016. LNCS 9863, pp 45–54. Slides with movies of computer simulation: Hiroshima University Institutional Repository. http://ir.lib.hiroshima-u.ac.jp/00039997
Morita K (2017) Two small universal reversible Turing machines. In: Adamatzky A (ed) Advances in unconventional computing Vol. 1: Theory. Springer. pp 221–237
Morita K, Harao M (1989) Computation universality of one-dimensional reversible (injective) cellular automata. Trans IEICE Jpn E72:758–762
Morita K, Imai K (1996) Self-reproduction in a reversible cellular space. Theoret Comput Sci 168:337–366
Morita K, Ueno S (1992) Computation-universal models of two-dimensional 16-state reversible cellular automata. IEICE Trans Inf Syst E75-D:141–147
Morita K, Shirasaki A, Gono Y (1989) A 1-tape 2-symbol reversible Turing machine. Trans IEICE Jpn E-72:223–228
Morita K, Tojima Y, Imai K, Ogiro T (2002) Universal computing in reversible and number-conserving two-dimensional cellular spaces. In: Adamatzky A (ed) Collision-based computing. Springer, pp 161–199
Myhill J (1963) The converse of Moore’s Garden-of-Eden theorem. Proc Am Math Soc 14:658–686
Richardson D (1972) Tessellations with local transformations. J Comput Syst Sci 6:373–388
Sutner K (2004) The complexity of reversible cellular automata. Theoret Comput Sci 325:317–328
Toffoli T (1977) Computation and construction universality of reversible cellular automata. J Comput Syst Sci 15:213–231
Toffoli T (1980) Reversible computing. In: de Bakker JW, van Leeuwen J (eds) Automata, languages and programming. LNCS 85, pp 632–644
Toffoli T, Margolus N (1990) Invertible cellular automata: a review. Physica D 45:229–253
Toffoli T, Capobianco S, Mentrasti P (2004) How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme. Theoret Comput Sci 325:329–344
von Neumann J (1966) In: Burks AW (ed) Theory of self-reproducing automata. The University of Illinois Press, Urbana
Watrous J (1995) On one-dimensional quantum cellular automata. In: Proceedings of the FOCS. pp 528–537
Books and Reviews
Adamatzky A (ed) (2002) Collision-based computing. Springer, London
Bennett CH (1988) Notes on the history of reversible computation. IBM J Res Dev 32:16–23
Burks A (ed) (1970) Essays on cellular automata. University of Illinois Press, Urbana
Kari J (2005) Theory of cellular automata: a survey. Theoret Comput Sci 334:3–33
Morita K (2017) Theory of reversible computing, Springer
Wolfram S (2001) A new kind of science. Wolfram Media, Champaign
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media LLC
About this entry
Cite this entry
Morita, K. (2017). Reversible Cellular Automata. In: Meyers, R. (eds) Encyclopedia of Complexity and Systems Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27737-5_455-6
Download citation
DOI: https://doi.org/10.1007/978-3-642-27737-5_455-6
Received:
Accepted:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27737-5
Online ISBN: 978-3-642-27737-5
eBook Packages: Springer Reference Physics and AstronomyReference Module Physical and Materials ScienceReference Module Chemistry, Materials and Physics
Publish with us
Chapter history
-
Latest
Reversible Cellular Automata- Published:
- 31 January 2018
DOI: https://doi.org/10.1007/978-3-642-27737-5_455-7
-
Reversible Cellular Automata
- Published:
- 26 September 2017
DOI: https://doi.org/10.1007/978-3-642-27737-5_455-6
-
Original
Reversible Cellular Automata- Published:
- 05 November 2015
DOI: https://doi.org/10.1007/978-3-642-27737-5_455-5