Skip to main content

Commutators of Bipermutive and Affine Cellular Automata

  • Conference paper
Cellular Automata and Discrete Complex Systems (AUTOMATA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8155))

Abstract

We discuss bipermutive cellular automata from a combinatorial and topological perspective. We prove a type of topological randomizing property for bipermutive CA, show that the commutator of a bipermutive CA is always small and that bipermutive affine CA have only affine CA in their commutator. We show the last result also in the multidimensional case, proving a conjecture of [Moore-Boykett, 97].

Research supported by the Academy of Finland Grant 131558.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boyle, M., Lind, D., Rudolph, D.: The automorphism group of a shift of finite type. Transactions of the American Mathematical Society 306(1), 71–114 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3, 320–375 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  3. Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  4. Moore, C., Boykett, T.: Commuting cellular automata. Complex Systems 11(1), 55–64 (1997)

    MathSciNet  Google Scholar 

  5. Pivato, M.: The ergodic theory of cellular automata. Int. J. General Systems 41(6), 583–594 (2012)

    Article  MathSciNet  Google Scholar 

  6. Pivato, M., Yassawi, R.: Limit measures for affine cellular automata ii. Ergodic Theory and Dynamical Systems 24, 1961–1980 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Salo, V.: On Nilpotency and Asymptotic Nilpotency of Cellular Automata. ArXiv e-prints (May 2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salo, V., Törmä, I. (2013). Commutators of Bipermutive and Affine Cellular Automata. In: Kari, J., Kutrib, M., Malcher, A. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2013. Lecture Notes in Computer Science, vol 8155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40867-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40867-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40866-3

  • Online ISBN: 978-3-642-40867-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics