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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Pal Chaudhuri, P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata, Theory and Applications, vol. 1. John Wiley & Sons (1997)
Elspas, B.: The Theory of Autonomous Linear Sequential Networks Circuit Theory. IRE Transactions on Issue Date 6(1), 45–60 (1959)
Fujio, M.: XOR2 = 90 - graded algebra structure of the boolean algebra of local transition rules. Papers Res. Inst. Math. Sci. 1599, 97–102 (2008)
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)
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)
von Neumann, J.: Theory of self-reproducing automata. Univ. of Illinois Press (1966)
Pries, W., Thanailakis, A., Card, H.: Group properties of cellular automata and VLSI applications. IEEE Trans. on Computers C-35(12), 1013–1024 (1986)
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)
Voorhees, B.: Commutation of Cellular Automata Rules. Complex Systems 7, 309–325 (1993)
Wolfram, S.: Statistical Mechanics of Cellular Automata. Reviews of Modern Physics 55, 601–644 (1983)
Wolfram, S.: Random Sequence Generation by Cellular Automata. Advances in Applied Mathematics 7, 123–169 (1986)
Yukita, S.: Dynamics of Cellular Automata on Groups. IEICE Trans. Inf. & Syst. E82-D(10), 1316–1323 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)