Skip to main content
SpringerLink
Log in

Limit Cycle for Composited Cellar Automata

  • Conference paper
Cellular Automata (ACRI 2012)

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

Included in the following conference series:

  • 2770 Accesses

Abstract

We know that a few uniform cellular automata have maximum cycle lengths. However, there are many uniform cellular automata, and checking the cycles of all uniform cellular automata is impractical. In this paper, we define a cellular automaton by composition and show how its cycles are related.

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

Access this chapter

Log in via an institution
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 54.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. Pal Chaudhuri, P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata, Theory and Applications, vol. 1. John Wiley & Sons (1997)

    Google Scholar 

  2. Elspas, B.: The Theory of Autonomous Linear Sequential Networks Circuit Theory. IRE Transactions on Issue Date 6(1), 45–60 (1959)

    Google Scholar 

  3. Fujio, M.: XOR2 = 90 - graded algebra structure of the boolean algebra of local transition rules. Papers Res. Inst. Math. Sci. 1599, 97–102 (2008)

    Google Scholar 

  4. Ito, T., Fujio, M., Inokuchi, S., Mizoguchi, Y.: Composition, union and division of cellular automata on groups. In: Proc. of the 16th International Workshop on Cellular Automata and Discrete Complex Systems, Automata 2010, pp. 255–264 (2010)

    Google Scholar 

  5. Matsumoto, M.: Simple Cellular Automata as Pseudorandom m-Sequence Generators for Bulit-In Self-Tes. ACM Transactions on Modeling and Computer Simulation 8(1), 31–42 (1988)

    Article  Google Scholar 

  6. von Neumann, J.: Theory of self-reproducing automata. Univ. of Illinois Press (1966)

    Google Scholar 

  7. Pries, W., Thanailakis, A., Card, H.: Group properties of cellular automata and VLSI applications. IEEE Trans. on Computers C-35(12), 1013–1024 (1986)

    Article  MATH  Google Scholar 

  8. Tezuka, S., Fushimi, M.: A method of designing cellular automata as pseudorandom number generators for built-in self-test for VLSI. Finite Fields: Theory, Applications, and Algorithms 168, 363–367 (1994)

    Article  MathSciNet  Google Scholar 

  9. Voorhees, B.: Commutation of Cellular Automata Rules. Complex Systems 7, 309–325 (1993)

    MathSciNet  MATH  Google Scholar 

  10. Wolfram, S.: Statistical Mechanics of Cellular Automata. Reviews of Modern Physics 55, 601–644 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  11. Wolfram, S.: Random Sequence Generation by Cellular Automata. Advances in Applied Mathematics 7, 123–169 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  12. Yukita, S.: Dynamics of Cellular Automata on Groups. IEICE Trans. Inf. & Syst. E82-D(10), 1316–1323 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Fundamental Education, Kyushu Sangyo University, Fukuoka, 813-8503, Japan

    Toshikazu Ishida

  2. Faculty of Mathematics, Kyushu University, Fukuoka, 819-0395, Japan

    Shuichi Inokuchi

Authors
  1. Toshikazu Ishida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuichi Inokuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Laboratory of Electronics, Democritus University of Thrace, GR 67100, Xanthi, Greece

    Georgios Ch. Sirakoulis

  2. CSAI - Complex Systems and Artificial Intelligence Research Center, University of Milano-Bicocca, 20134, Milano, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishida, T., Inokuchi, S. (2012). Limit Cycle for Composited Cellar Automata. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33350-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33349-1

  • Online ISBN: 978-3-642-33350-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation