Advertisement

Sequentializing Cellular Automata

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10875)

Abstract

We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a single left-to-right sweep of a bijective rule from left to right over an infinite tape.

Notes

Acknowledgement

The authors gratefully acknowledge partial support for this work by two short term scientific missions of the EU COST Action IC1405.

References

  1. 1.
    Kari, J., Salo, V., Worsch, T.: Sequentializing cellular automata. ArXiv e-prints, February 2018. arxiv.org/abs/1802.06668
  2. 2.
    Kari, J.: Representation of reversible cellular automata with block permutations. Math. Syst. Theory 29(1), 47–61 (1996)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Kůrka, P.: Topological dynamics of cellular automata. In: Meyers, R. (eds.) Computational complexity, pp. 3212–3233. Springer, New York (2012).  https://doi.org/10.1007/978-1-4614-1800-9CrossRefGoogle Scholar
  4. 4.
    Perrin, D., Pin, J.É.: Infinite Words: Automata, Semigroups, Logic and Games, vol. 141. Academic Press, Amsterdam (2004)MATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2018

Authors and Affiliations

  1. 1.University of TurkuTurkuFinland
  2. 2.Karlsruhe Institute of TechnologyKarlsruheGermany

Personalised recommendations