Skip to main content
SpringerLink
Log in

Reversible Cellular Automata

  • Reference work entry
Handbook of Natural Computing

Abstract

A reversible cellular automaton (RCA) is a special type of cellular automaton (CA) such that every configuration of it has only one previous configuration, and hence its evolution process can be traced backward uniquely. Here, we discuss how RCAs are defined, their properties, how one can find and design them, and their computing abilities. After describing definitions on RCAs, a survey is given on basic properties on injectivity and surjectivity of their global functions. Three design methods of RCAs are then given: using CAs with block rules, partitioned CAs, and second-order CAs. Next, the computing ability of RCAs is discussed. In particular, we present simulation methods for irreversible CAs, reversible Turing machines, and some other universal systems by RCAs, in order to clarify the universality of RCAs. In spite of the strong constraint of reversibility, it can be seen that RCAs have rich abilities in computing and information processing, and even very simple RCAs have universal computing ability.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 999.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Amoroso S, Cooper G (1970) The Garden of Eden theorem for finite configurations. Proc Am Math Soc 26:158–164

    Article  MathSciNet  MATH  Google Scholar 

  • Amoroso S, Patt YN (1972) Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J Comput Syst Sci 6:448–464

    Article  MathSciNet  MATH  Google Scholar 

  • Bennett CH (1973) Logical reversibility of computation. IBM J Res Dev 17:525–532

    Article  MATH  Google Scholar 

  • Boykett T (2004) Efficient exhaustive listings of reversible one dimensional cellular automata. Theor Comput Sci 325:215–247

    Article  MathSciNet  MATH  Google Scholar 

  • Cook M (2004) Universality in elementary cellular automata. Complex Syst 15:1–40

    MATH  Google Scholar 

  • Czeizler E, Kari J (2007) A tight linear bound for the synchronization delay of bijective automata. Theor Comput Sci 380:23–36

    Article  MathSciNet  MATH  Google Scholar 

  • Durand-Lose J (1995) Reversible cellular automaton able to simulate any other reversible one using partitioning automata. In: Proceedings of LATIN 95, Valparaiso, Chile, LNCS 911. Springer, pp 230–244

    Google Scholar 

  • Fredkin E, Toffoli T (1982) Conservative logic. Int J Theor Phys 21:219–253

    Article  MathSciNet  MATH  Google Scholar 

  • Hedlund GA (1969) Endomorphisms and automorphisms of the shift dynamical system. Math Syst Theory 3:320–375

    Article  MathSciNet  MATH  Google Scholar 

  • Imai K, Hori T, Morita K (2002) Self-reproduction in three-dimensional reversible cellular space. Artif Life 8:155–174

    Article  Google Scholar 

  • Imai K, Morita K (1996) Firing squad synchronization problem in reversible cellular automata. Theor Comput Sci 165:475–482

    Article  MathSciNet  MATH  Google Scholar 

  • Imai K, Morita K (2000) A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theor Comput Sci 231:181–191

    Article  MathSciNet  MATH  Google Scholar 

  • Kari J (1994) Reversibility and surjectivity problems of cellular automata. J Comput Syst Sci 48:149–182

    Article  MathSciNet  MATH  Google Scholar 

  • Kari J (1996) Representation of reversible cellular automata with block permutations. Math Syst Theory 29:47–61

    MathSciNet  MATH  Google Scholar 

  • Kari J (2005a) Theory of cellular automata: a survey. Theor Comput Sci 334:3–33

    Article  MathSciNet  MATH  Google Scholar 

  • Kari J (2005b) Reversible cellular automata. In: Proceedings of the DLT 2005, Palermo, Italy, LNCS 3572. Springer, pp 57–68

    Google Scholar 

  • Kutrib M, Malcher A (2008) Fast reversible language recognition using cellular automata. Inf Comput 206:1142–1151

    Article  MathSciNet  MATH  Google Scholar 

  • Landauer R (1961) Irreversibility and heat generation in the computing process. IBM J Res Dev 5:183–191

    Article  MathSciNet  MATH  Google Scholar 

  • Lecerf Y (1963) Machines de Turing réversibles — Reursive insolubilité en n ∈ N de l'équation u = θ n u, où θ est un isomorphisme de codes. Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences 257:2597–2600

    MathSciNet  Google Scholar 

  • Margolus N (1984) Physics-like model of computation. Physica 10D:81–95

    MathSciNet  Google Scholar 

  • Maruoka A, Kimura M (1976) Condition for injectivity of global maps for tessellation automata. Inf Control 32:158–162

    Article  MathSciNet  MATH  Google Scholar 

  • Maruoka A, Kimura M (1979) Injectivity and surjectivity of parallel maps for cellular automata. J Comput Syst Sci 18:47–64

    Article  MathSciNet  MATH  Google Scholar 

  • Minsky ML (1967) Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs, NJ

    MATH  Google Scholar 

  • Moore EF (1962) Machine models of self-reproduction. In: Proceedings of the symposia in applied mathematics, vol 14. American Mathematical Society, New York, pp 17–33

    Google Scholar 

  • Mora JCST, Vergara SVC, Martinez GJ, McIntosh HV (2005) Procedures for calculating reversible one-dimensional cellular automata. Physica D 202:134–141

    Article  MathSciNet  MATH  Google Scholar 

  • Morita K (1995) Reversible simulation of one-dimensional irreversible cellular automata. Theor Comput Sci 148:157–163

    Article  MATH  Google Scholar 

  • Morita K (1996) Universality of a reversible two-counter machine. Theor Comput Sci 168:303–320

    Article  MATH  Google Scholar 

  • Morita K (2001a) Cellular automata and artificial life — computation and life in reversible cellular automata. In: Goles E, Martinez S (eds) Complex systems. Kluwer, Dordrecht, pp 151–200

    Chapter  Google Scholar 

  • Morita K (2001b) A simple reversible logic element and cellular automata for reversible computing. In: Proceedings of the 3rd international conference on machines, computations, and universality, LNCS 2055. Springer, Heidelberg, Germany, pp 102–113

    Google Scholar 

  • Morita K (2007) Simple universal one-dimensional reversible cellular automata. J Cell Autom 2:159–165

    MathSciNet  MATH  Google Scholar 

  • Morita K (2008a) Reversible computing and cellular automata — a survey. Theor Comput Sci 395:101–131

    Article  MATH  Google Scholar 

  • Morita K (2008b) A 24-state universal one-dimensional reversible cellular automaton. In: Adamatzky A et al. (eds) Proceedings of AUTOMATA-2008. Luniver Press, Bristol, UK, pp 106–112

    Google Scholar 

  • Morita K, Harao M (1989) Computation universality of one-dimensional reversible (injective) cellular automata. Trans IEICE Jpn E-72:758–762

    Google Scholar 

  • Morita K, Imai K (1996) Self-reproduction in a reversible cellular space. Theor Comput Sci 168:337–366

    Article  MathSciNet  MATH  Google Scholar 

  • Morita K, Yamaguchi Y (2007) A universal reversible Turing machine. In: Proceedings of the 5th international conference on machines, computations, and universality, LNCS 4664. Springer, pp 90–98

    Google Scholar 

  • Morita K, Shirasaki A, Gono Y (1989) A 1-tape 2-symbol reversible Turing machine. Trans IEICE Jpn E-72:223–228

    Google Scholar 

  • 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, London, UK, pp 161–199

    Chapter  Google Scholar 

  • Myhill J (1963) The converse of Moore's Garden-of-Eden theorem. Proc Am Math Soc 14:658–686

    Article  MathSciNet  Google Scholar 

  • von Neumann J (1966) In: Burks AW (ed) Theory of self-reproducing automata. The University of Illinois Press, Urbana, IL

    Google Scholar 

  • Ollinger N (2002) The quest for small universal cellular automata. In: Proceedings of ICALP, LNCS 2380. Lyon, France, pp 318–329

    Google Scholar 

  • Ollinger N, Richard G (2006) A particular universal cellular automaton, oai:hal.archives-ouvertes.fr:hal-00095821_v2

    Google Scholar 

  • Richardson D (1972) Tessellations with local transformations. J Comput Syst Sci 6:373–388

    Article  MATH  Google Scholar 

  • Sutner K (1991) De Bruijn graphs and linear cellular automata. Complex Syst 5:19–31

    MathSciNet  MATH  Google Scholar 

  • Sutner K (2004) The complexity of reversible cellular automata. Theor Comput Sci 325:317–328

    Article  MathSciNet  MATH  Google Scholar 

  • Toffoli T (1977) Computation and construction universality of reversible cellular automata. J Comput Syst Sci 15:213–231

    Article  MathSciNet  MATH  Google Scholar 

  • Toffoli T (1980) Reversible computing. In: de Bakker JW, van Leeuwen J (eds) Automata, languages and programming, LNCS 85. Springer, Berlin, Germany, pp 632–644

    Chapter  Google Scholar 

  • Toffoli T, Margolus N (1987) Cellular automata machines. The MIT Press, Cambridge, MA

    Google Scholar 

  • Toffoli T, Margolus N (1990) Invertible cellular automata: a review. Physica D 45:229–253

    Article  MathSciNet  MATH  Google Scholar 

  • Toffoli T, Capobianco S, Mentrasti P (2004) How to turn a second-order cellular automaton into lattice gas: a new inversion scheme. Theor Comput Sci 325:329–344

    Article  MathSciNet  MATH  Google Scholar 

  • Watrous J (1995) On one-dimensional quantum cellular automata. In: Proceedings of the 36th symposium on foundations of computer science. Las Vegas, NV. IEEE, pp 528–537

    Google Scholar 

  • Wolfram S (2001) A new kind of science. Wolfram Media, Champaign, IL

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, Graduate School of Engineering, Hiroshima University, Hiroshima, Japan

    Kenichi Morita

Authors
  1. Kenichi Morita
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIACS, Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

  2. Computer Science Department, University of Colorado, Boulder, USA

    Grzegorz Rozenberg

  3. LIACS, Leiden University, Leiden, The Netherlands

    Thomas Bäck

  4. LIACS, Leiden University, Leiden, The Netherlands

    Joost N. Kok

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this entry

Cite this entry

Morita, K. (2012). Reversible Cellular Automata. In: Rozenberg, G., Bäck, T., Kok, J.N. (eds) Handbook of Natural Computing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92910-9_7

Download citation

Publish with us

Policies and ethics

Search

Navigation