Skip to main content
Log in

On the hierarchy of conservation laws in a cellular automaton

Natural Computing Aims and scope Submit manuscript

Abstract

Conservation laws in cellular automata (CA) are studied as an abstraction of the conservation laws observed in nature. In addition to the usual real-valued conservation laws we also consider more general group-valued and semigroup-valued conservation laws. The (algebraic) conservation laws in a CA form a hierarchy, based on the range of the interactions they take into account. The conservation laws with smaller interaction ranges are the homomorphic images of those with larger interaction ranges, and for each specific range there is a most general law that incorporates all those with that range. For one-dimensional CA, such a most general conservation law has—even in the semigroup-valued case—an effectively constructible finite presentation, while for higher-dimensional CA such effective construction exists only in the group-valued case. It is even undecidable whether a given two-dimensional CA conserves a given semigroup-valued energy assignment. Although the local properties of this hierarchy are tractable in the one-dimensional case, its global properties turn out to be undecidable. In particular, we prove that it is undecidable whether this hierarchy is trivial or unbounded. We point out some interconnections between the structure of this hierarchy and the dynamical properties of the CA. In particular, we show that positively expansive CA do not have non-trivial real-valued conservation laws.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. This is not the only possible approach, but it sounds most natural to us. For the real-valued energies, this and several other approaches lead to equivalent definitions (see Durand et al. 2003; Hattori and Takesue 1991; Pivato 2002).

References

  • Biryukov AP (1967) Some algorithmic problems for finitely defined commutative semigroups. Sib Math J 8:384–391

    MATH  Google Scholar 

  • Blondel VD, Cassaigne J, Nichitiu C (2002) On the presence of periodic configurations in turing machines and in counter machines. Theor Comput Sci 289:573–590

    Article  MathSciNet  MATH  Google Scholar 

  • Boccara N, Fukś H (1998) Cellular automaton rules conserving the number of active sites. J Phys A 31:6007–6018

    Article  MathSciNet  MATH  Google Scholar 

  • Conway JH, Lagarias JC (1990) Tiling with polyominoes and combinatorial group theory. J Comb Theory A 53:183–208

    Article  MathSciNet  MATH  Google Scholar 

  • Durand B, Formenti E, Róka Z (2003) Number conserving cellular automata I: decidability. Theor Comput Sci 299:523–535

    Article  MathSciNet  MATH  Google Scholar 

  • Finelli M, Manzini G, Margara K (1998) Lyapunov exponents versus expansivity and sensitivity in cellular automata. J Complex 14:210–233

    Article  MathSciNet  MATH  Google Scholar 

  • Formenti E, Grange A (2003) Number conserving cellular automata II: dynamics. Theor Comput Sci 304:269–290

    Article  MathSciNet  MATH  Google Scholar 

  • Formenti E, Kari J, Taati S (2008) The most general conservation law for a cellular automaton. In: Hirsch EA, Razborov AA, Semenov AL, Slissenko A (eds) CSR vol 5010 of Lecture notes in computer science. Springer, New York, pp 194–203

    Google Scholar 

  • Fukś H (2000) A class of cellular automata equivalent to deterministic particle systems. In: Feng S, Lawniczak AT, Varadhan SRS (eds) Hydrodynamic limits and related topics, vol 27 of Fields institute communications. American Mathematical Society, Providence, pp 57–69

    Google Scholar 

  • Grillet PA (1995) Semigroups: an introduction to the structure theory. Dekker, New York

    Google Scholar 

  • Hardy J, de Pazzis O, Pomeau Y (1976) Molecular dynamics of a classical lattice gas: transport properties and time correlation functions. Phys Rev A 13:1949–1961

    Article  Google Scholar 

  • Hattori T, Takesue S (1991) Additive conserved quantities in discrete-time lattice dynamical systems. Physica D 49:295–322

    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 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Kari J (2000) Linear cellular automata with multiple state variables. In: Reichel H, Tison S (eds) STACS vol 1770 of Lecture notes in computer science. Springer, New York, pp 110–121

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Kůrka P (1997) Languages, equicontinuity and attractors in cellular automata. Ergod Theory Dyn Syst 17:417–433

    Article  MathSciNet  MATH  Google Scholar 

  • Kůrka P (2003) Topological and symbolic dynamics, vol 11 of Cours Spécialisés, Société Mathématique de France

  • Manzini G, Margara L (1999) A complete and efficiently computable topological classification of d-dimensional linear cellular automata over \({{\mathbb{Z}}_m}.\) Theor Comput Sci 221:157–177

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  • Moore EF (1962) Machine models of self-reproduction. In: Proceedings of symposia in applied mathematics. AMS, Providence, pp 17–33

  • Moreira A, Boccara N, Goles E (2004) On conservative and monotone one-dimensional cellular automata and their particle representation. Theor Comput Sci 325:285–316

    Article  MathSciNet  MATH  Google Scholar 

  • Myhill J (1963) The converse of Moore’s garden-of-Eden theorem. Proc Am Math Soc 14:685–686

    Google Scholar 

  • Nasu M (1995) Textile systems for endomorphisms and automorphisms of the shift. Mem Am Math Soc 114, no. 546, pp viii + 215

  • Pivato M (2002) Conservation laws in cellular automata. Nonlinearity 15:1781–1793

    Article  MathSciNet  MATH  Google Scholar 

  • Pomeau Y (1984) Invariant in cellular automata. J Phys A 17:L415–L418

    Article  MathSciNet  Google Scholar 

  • Robison AD (1987) Fast computation of additive cellular automata. Complex Syst 1:211–216

    MathSciNet  MATH  Google Scholar 

  • Takesue S (1987) Reversible cellular automata and statistical mechanics. Phys Rev Lett 59:2499–2502

    Article  MathSciNet  Google Scholar 

  • Thurston WP (1990) Conway’s tiling groups. Am Math Mon 97:757–773

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work has been supported by the French ANR Blanc Project “EMC” and the Academy of Finland grant 131558.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jarkko Kari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Formenti, E., Kari, J. & Taati, S. On the hierarchy of conservation laws in a cellular automaton. Nat Comput 10, 1275–1294 (2011). https://doi.org/10.1007/s11047-010-9222-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-010-9222-0

Keywords

Navigation