Advertisement

The Most General Conservation Law for a Cellular Automaton

  • Enrico Formenti
  • Jarkko Kari
  • Siamak Taati
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5010)

Abstract

We study the group-valued and semigroup-valued conservation laws in cellular automata (CA). We provide examples to distinguish between semigroup-valued, group-valued and real-valued conservation laws. We prove that, even in one-dimensional case, it is undecidable if a CA has any non-trivial conservation law of each type. For a fixed range, each CA has a most general (group-valued or semigroup-valued) conservation law, encapsulating all conservation laws of that range. For one-dimensional CA the semigroup corresponding to such a most general conservation law has an effectively constructible finite presentation, while for higher-dimensional ones no such effective construction exists.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Biryukov, A.P.: Some algorithmic problems for finitely defined commutative semigroups. Siberian Mathematical Journal 8, 384–391 (1967)zbMATHGoogle Scholar
  2. 2.
    Blondel, V.D., Cassaigne, J., Nichitiu, C.: On the presence of periodic configurations in Turing machines and in counter machines. Theoretical Computer Science 289, 573–590 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Boccara, N., Fukś, H.: Number-conserving cellular automaton rules. Fundamenta Informaticae 52, 1–13 (2002)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Conway, J.H., Lagarias, J.C.: Tiling with polyominoes and combinatorial group theory. Journal of Combinatorial Theory A 53, 183–208 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Durand, B., Formenti, E., Róka, Z.: Number conserving cellular automata I: decidability. Theoretical Computer Science 299, 523–535 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Formenti, E., Grange, A.: Number conserving cellular automata II: dynamics. Theoretical Computer Science 304, 269–290 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Grillet, P.A.: Semigroups: An Introduction to the Structure Theory. Dekker, New York (1995)Google Scholar
  8. 8.
    Hattori, T., Takesue, S.: Additive conserved quantities in discrete-time lattice dynamical systems. Physica D 49, 295–322 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Kari, J.: Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences 48, 149–182 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Kari, J.: Theory of cellular automata: A survey. Theoretical Computer Science 334, 3–33 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)zbMATHGoogle Scholar
  12. 12.
    Moore, E.F.: Machine models of self-reproduction. In: Proceedings of Symposia in Applied Mathematics, pp. 17–33. AMS (1962)Google Scholar
  13. 13.
    Myhill, J.: The converse of Moore’s Garden-of-Eden theorem. Proceedings of the American Mathematical Society 14, 685–686 (1963)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Pivato, M.: Conservation laws in cellular automata. Nonlinearity 15, 1781–1793 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Robison, A.D.: Fast computation of additive cellular automata. Complex Systems 1, 211–216 (1987)MathSciNetGoogle Scholar
  16. 16.
    Thurston, W.P.: Conway’s tiling groups. American Mathematical Monthly 97, 757–773 (1990)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Enrico Formenti
    • 1
  • Jarkko Kari
    • 2
  • Siamak Taati
    • 2
    • 3
  1. 1.Départment d’Informatique, Parc ValroseUniversité de Nice-Sophia AntipolisNice Cedex 2France
  2. 2.Department of MathematicsUniversity of TurkuTurkuFinland
  3. 3.Turku Centre for Computer ScienceTurkuFinland

Personalised recommendations