Skip to main content

An Extension of Wolfram’s Rule 90 for One-Dimensional Cellular Automata over Non-Abelian Group Alphabets

  • Chapter
  • First Online:
A Celebration of the EDGE Program’s Impact on the Mathematics Community and Beyond

Part of the book series: Association for Women in Mathematics Series ((AWMS,volume 18))

Abstract

We study one-dimensional cellular automata with local update rule defined by an extension of Wolfram’s Rule 90 over non-abelian group alphabets. In particular we develop necessary and sufficient conditions for a state in such an automaton to have a predecessor. We apply our results to compute the fraction of states that are reachable through evolution of an automaton over a finite dihedral group.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

Notes

  1. 1.

    It is important to mention that \(S^{\prime }_0\) evolves to S 0 under the update rule which maps

    Hence, the study of automata with even length, W, under the original update rule corresponds to study of automata of length \(\frac {W}{2}\) under the update rule written above. Corresponding results are inherent within the paper. While we note this here, we do not discuss it again explicitly.

References

  1. Bardzell, M. and Miller, N. The Evolution Homomorphism and Permutation Actions on Group Generated Cellular Automata. Complex Systems, Volume 15, Issue 2. 2004.

    Google Scholar 

  2. Wolfram, S., Martin, O., and Odlyzko, A.M. Algebraic Properties of Cellular Automata. Communications in Mathematical Physics, 93. 1984.

    Google Scholar 

  3. GAP - Groups, Algorithms, Programming - a System for Computational Discrete Algebra. http://www.gap-system.org/. 1995.

  4. The PascGalois Project: Visualizing Abstract Mathematics. pascgalois.org. 2008.

    Google Scholar 

  5. Rennard, J. Introduction to Cellular Automata. http://www.rennard.org/alife/english/acintrogb01.html. 2006.

  6. Neumann, J. von. Re-evaluation of the problems of complicated automata: Problems of hierarchy and evolution. Papers of John von Neumann on Computing and Computer Theory. W. Aspray and A. Burks, eds., MIT Press. 1987.

    Google Scholar 

  7. Neumann, J. von. General and Logical Theory of Automata. Cerebral Mechanisms of Behavior. Lloyd A. Jeffress, ed. New York: John Wiley and Sons, Inc. 1951.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eirini Poimenidou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 The Author(s) and the Association for Women in Mathematics

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Craig, E., Poimenidou, E. (2019). An Extension of Wolfram’s Rule 90 for One-Dimensional Cellular Automata over Non-Abelian Group Alphabets. In: D'Agostino, S., Bryant, S., Buchmann, A., Guinn, M., Harris, L. (eds) A Celebration of the EDGE Program’s Impact on the Mathematics Community and Beyond . Association for Women in Mathematics Series, vol 18. Springer, Cham. https://doi.org/10.1007/978-3-030-19486-4_20

Download citation

Publish with us

Policies and ethics