Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Conclusion
References
All Topics
Mathematics
Applied Mathematics

The Complexity of Permutive Cellular Automata

Profile image of Chih-Hung ChangChih-Hung Chang

Journal of cellular automata

Abstract

This paper studies cellular automata in two aspects: Ergodic and topological behavior. For ergodic aspect, the formulae of measure-theoretic entropy, topological entropy and topological pressure are given in closed forms and Parry measure is demonstrated to be an equilibrium measure for some potential function. For topological aspect, an example is examined to show that the exhibition of snap-back repellers for a cellular automaton infers Li-Yorke chaos. In addition, bipermutive cellular automata are optimized for the exhibition of snap-back repellers in permutive cellular automata whenever two-sided shift space is considered.

Related papers

The topological entropy of invertible cellular automata
Hasan Akin

Journal of Computational and Applied Mathematics, 2008

This paper is concerned with the topological entropy of invertible one-dimensional linear cellular automata, i.e., the maps T f [−r,r] :

View PDFchevron_right
Investigating topological chaos by elementary cellular automata dynamics
Michele Finelli

Theoretical Computer Science, 2000

We apply the two di erent deÿnitions of chaos given by Devaney and by Knudsen for general discrete time dynamical systems (DTDS) to the case of elementary cellular automata, i.e., 1-dimensional binary cellular automata with radius 1. A DTDS is chaotic according to the Devaney's deÿnition of chaos i it is topologically transitive, has dense periodic orbits, and it is sensitive to initial conditions. A DTDS is chaotic according to the Knudsen's deÿnition of chaos i it has a dense orbit and it is sensitive to initial conditions. We enucleate an easy-to-check property (left or rightmost permutivity) of the local rule associated with a cellular automaton which is a su cient condition for D-chaotic behavior. It turns out that this property is also necessary for the class of elementary cellular automata. Finally, we prove that the above mentioned property does not remain a necessary condition for chaoticity in the case of non elementary cellular automata.

View PDFchevron_right
Topological and measure-theoretic properties of one-dimensional cellular automata
François Blanchard

Physica D-nonlinear Phenomena, 1997

This is a survey of known results and open questions about the topological and ergodic dynamics of one-dimensional cellular automata.

View PDFchevron_right
Ergodic Theory of Cellular Automata
Marcus Pivato

2009

View PDFchevron_right
A geometrical interpretation of the chaotic state of inhomogeneous deterministic cellular automata
Alex Hansen

Physica A: Statistical Mechanics and its Applications, 1989

We propose a geometrical interpretation of the chaotic state of inhomogeneous cellular automata. From the ru:!es of the cellular automaton we construct a network. The percolating phase of this network ,:oincides with the chaotic phase of the cellular automaton. We also report numerical tests < f these ideas on several cellular automata.

View PDFchevron_right
A full computation-relevant topological dynamics classification of elementary cellular automata
Ruedi Stoop

Chaos: An Interdisciplinary Journal of Nonlinear Science, 2012

View PDFchevron_right
The topological entropy of nth iteration of an additive cellular automata
Hasan Akın

Applied Mathematics and Computation, 2006

In this paper, our aim is to investigate the topological entropy of nth iteration of an one-dimensional additive cellular automata (CA hereafter), i.e. the maps T : Z Z m ! Z Z m which are given by Tx ¼ ðy n Þ 1 n¼À1 , y n ¼ F ðx nÀr ; . . . ; x nþr Þ ¼ P r i¼Àr k i x nþi ðmod mÞ, x ¼ ðx n Þ 1 n¼À1 2 Z Z m and F : Z 2rþ1 m ! Z m , over Z m ðm P 2Þ by means of both the algorithm and Lyapunov exponents of the CA T that is given by DÕamico et al. [Theor. Comput. Sci. 290 (2003) 1629-1646. We show that if the local rule F is bipermutative (in Hedl-undÕs terminology), then the topological entropy of nth iteration of one-dimensional additive CA is 2nr log m. We obtain necessary and sufficient conditions for the topological entropy of nth iteration of CA to be 2nr log m. We show that the uniform Bernoulli measure is a measure of maximal entropy for the nth iteration of the CA generated by bipermutative local rule F.

View PDFchevron_right
Dynamics and topological entropy of 1D Greenberg–Hastings cellular automata
Dennis Ulbrich

Ergodic Theory and Dynamical Systems, 2020

In this paper we analyse the non-wandering set of one-dimensional Greenberg–Hastings cellular automaton models for excitable media with $e\geqslant 1$ excited and $r\geqslant 1$ refractory states and determine its (strictly positive) topological entropy. We show that it results from a Devaney chaotic closed invariant subset of the non-wandering set that consists of colliding and annihilating travelling waves, which is conjugate to a skew-product dynamical system of coupled shift dynamics. Moreover, we determine the remaining part of the non-wandering set explicitly as a Markov system with strictly less topological entropy that also scales differently for large $e,r$.

View PDFchevron_right
On the Dynamical Behavior of Chaotic Cellular Automata
Luciano Margara, Giancarlo Mauri

Theoretical Computer Science, 1999

The shift (bi-infinite) cellular automaton is a chaotic dynamical system according to all the definitions of deterministic chaos given for discrete time dynamical systems (e.g., those given by Devaney [6] and by Knudsen [10]). The main motivation to this fact is that the temporal evolution of the shift cellular automaton under finite description of the initial state is unpredictable. Even

View PDFchevron_right
The Topological Directional Entropy of Z^ 2-actions Generated by Linear Cellular Automata
Hasan Akin

Arxiv preprint arXiv:0802.0953, 2008

In this paper we study the topological directional entropy of 2 -actions by generated linear cellular automata (CA hereafter

View PDFchevron_right

References (37)

  1. S. Ulam, Random process and transformations, Proc. Int. Congress of Math. 2 (1952) 264-275.
  2. J. von Neumann, Theory of self-reproducing automata, Univ. of Illinois Press, Urbana, 1966.
  3. J. M. Greenberg, S. P. Hastings, Spatial patterns for discrete models of diffusion in excitable media, SIAM J. Appl. Math. 34 (1978) 515-523.
  4. G. Bub, A. Shrier, L. Glass, Spiral Wave Generation in Heterogeneous Excitable Media, Phys. Rev. Lett. 88 (2002) 058101.
  5. Y. B. Chernyak, A. B. Feldman, R. J. Cohen, Correspondence between discrete and continuous models of excitable media: Trigger waves, Phys. Rev. E 55 (1997) 3125-3233.
  6. A. B. Feldman, Y. B. Chernyak, R. J. Cohen, Wave-front propagation in a discrete model of excitable media, Phys. Rev. E 57 (1998) 7025-7040.
  7. J. Hardy, O. de Pazzis, Y. Pomeau, Molecular dynamics of a classical lattice gas: transport prop- erties and time correlation functions, Phys. Rev. A 13 (1976) 1949-1960.
  8. M. Gardner, Wheels, life and other mathematical amusements, W. H. Freeman and Company, 1983.
  9. J. M. Greenberg, B. D. Hassard, S. P. Hastings, Pattern Formation and Periodic Structure in Systems Modeled By Reaction-Diffusion Equations, Bull. Amer. Math. Soc. 84 (1978) 1296-1327.
  10. J. M. Greenberg, C. Greene, S. P. Hastings, Acombinatorial problem arising in the study of reaction- diffusion equations, SIAM J. Algebraic Discrete Methods 1 (1980) 34-42.
  11. D. Richardson, Tessellation with Local Transformations, J. Compuut. System Sci. 6 (1972) 373V388.
  12. A. R. Smith III, Simple Computational Universal Spaces, J. Assoc. Comput. Mach. 18 (1971) 339V353.
  13. G. Y. Vichniac, Boolean Derivatives on Cellular Automata, Phys. D 45 (1990) 63V74.
  14. J. R. Weimar, J. J. Tyson, L. T. Watson, Third generation cellular automaton for modeling excitable media, Phys. D 55 (1992) 328-339.
  15. S. Wolfram, Statistical mechanics of cellular automata, Rev. Modern Physics 55 (1983) 601-644.
  16. G. A. Hedlund, Endomorphisms and automorphisms of full shift dynamical system, Math. Systems Theory 3 (1969) 320-375.
  17. S. Wolfram, Computation theory of cellular automata, Comm. Math. Phys. 96 (1984) 15-57.
  18. S. Wolfram, Twenty problems in the theory of cellular automata, Phys. Scripta 9 (1985) 170-172.
  19. G. Cattaneo, M. Finelli, L. Margara, Investigating topological chaos by elementary cellular au- tomata dynamics, Theoret. Comput. Sci. 244 (2000) 219-241.
  20. B. Codenotti, L. Margara, Transitive Cellular Automata are Sensitive, Amer. Math. Monthly 103 (1996) 58V62.
  21. P. Favati, G. Lotti, L. Margara, Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos, Theor. Comput. Sci. 174 (1997) 157-170.
  22. L. P. Hurd, J. Kari, K. Culik, The topological entropy of cellular automata is uncomputable, Ergodic Theory Dynam. Systems 82 (1992) 255-265.
  23. M. D'amico, G. Manzini, L. Margara, On computing the entropy of cellular automata, Theor. Comput. Sci. 290 (2003) 1629V1646.
  24. T. Ward, Additive cellular automata and volume growth, Entropy 2 (2000) 142-167.
  25. M. A. Shereshevsky, Ergodic properties of certain surjective cellular automata, Monatsh. Math. 114 (1992) 305-316.
  26. D. A. Lind, Application of ergodic theory and sofic systems to cellular automata, Physica D 10 (1984) 36-44.
  27. M. Sablik, Measure rigidity for algebraic bipermutive cellular automata, Ergodic Theory Dynam. Systems 27 (2007) 1965-1990.
  28. T.-Y. Li, J. A. Yorke, Period three implies chaos, Am. Math. Monthly 82 (1975) 985-992.
  29. F. R. Marotto, Snap-back repellers imply chaos in R n , J. Math. Anal. Appl. 63 (1978) 199-223.
  30. F. R. Marotto, On redefining a snap-back repeller, Chaos Solitons Fractals 25 (2005) 25-28.
  31. C. B. García, Chaos and topological entropy in dimension n > 1, Ergodic Theory Dynam. Systems 6 (1986) 163-165.
  32. F. Blanchard, E. Glasner, S. Kolyada, A. Maass, On Li-Yorke pairs, J. Reine Angew. Math. 547 (2002) 51-68.
  33. P. Walters, An introduction to ergodic theory, Springer-Verlag New York, 1982.
  34. F. Fagnani, L. Margara, Expansivity, permutivity, and chaos for cellular automata, Theory Comput. Systems 31 (1998) 663-677.
  35. M. Pollicott, M. Yuri, Dynamical systems and ergodic theory, Cambridge University Press, 1998.
  36. S. Wolfram, A new kind of science, Wolfram Media, Champaign Illinois, USA, 2002.
  37. S. Wiggins, Introduction to applied nonlinear dynamical systems and chaos, Springer-Verlag, Berlin, NY, 1990.

Related papers

Topological chaos for elementary cellular automata
Michele Finelli

Lecture Notes in Computer Science, 1997

We apply the definition of chaos given by Devaney for discrete time dynamical systems to the case of elementary cellular automata, i.e., 1-dimensional binary cellular automata with radius 1. A discrete time dynamical system is chaotic according to the Devaney's definition of chaos if it is topologically transitive, is sensitive to initial conditions, and has dense periodic orbits. We enucleate an easy-to-check property of the local rule on which a cellular automaton is based which is a necessary condition for chaotic behavior. We prove that this property is also sufficient for a large class of elementary cellular automata. The main contribution of this paper is the formal proof of chaoticity for many non additive elementary cellular automata. Finally, we prove that the above mentioned property does not remain a necessary condition for chaoticity in the case of non elementary cellular automata.

View PDFchevron_right
Some results about the chaotic behavior of cellular automata
Enrico Formenti

Theoretical Computer Science, 2005

We study the behavior of cellular automata (CA for short) in the Cantor, Besicovitch and Weyl topologies. We solve an open problem about the existence of transitive CA in the Besicovitch topology. The proof of this result has some interest of its own since it is obtained by using Kolmogorov complexity. To our knowledge it is the first result about discrete dynamical systems obtained using Kolmogorov complexity. We also prove that in the Besicovitch topology every CA has either a unique periodic point (thus a fixed point) or an uncountable set of periodic points. This result underlines the fact that CA have a great degree of stability; it may be considered a further step towards the understanding of CA periodic behavior.

View PDFchevron_right
On the quantitative behavior of the linear cellular automata
Hasan Akin, Chih-Hung Chang

2013

In this paper, we study the quantitative behavior of one-dimensional linear cellular automata T f [−r,r] , defined by local rule f (x −r , . . . , xr) = r i=−r λ i x i (mod m), acting on the space of all doubly infinite sequences with values in a finite ring Zm, m ≥ 2. Once generalize the formulas given by Ban et al. [J. Cellular Automata 6 (2011) 385-397] for measure-theoretic entropy and topological pressure of one-dimensional cellular automata, we calculate the measure entropy and the topological pressure of the linear cellular automata with respect to the Bernoulli measure on the set Z Z m . Also, it is shown that the uniform Bernoulli measure is the unique equilibrium measure for linear cellular automata. We compare values of topological entropy and topological directional entropy by using the formula obtained by Akın [J. Computation and Appl. Math. 225 (2) (2009) 459-466]. The topological directional entropy is interpreted by means of figures. As an application, we demonstrate that the Hausdorff of the limit set of a linear cellular automaton is the unique root of Bowen's equation. Some open problems remain to be of interest.

View PDFchevron_right
The Topological Pressure of Linear Cellular Automata
Chih-Hung Chang

Entropy, 2009

This elucidation studies ergodicity and equilibrium measures for additive cellular automata with prime states. Additive cellular automata are ergodic with respect to Bernoulli measure unless it is either an identity map or constant. The formulae of measure-theoretic and topological entropies can be expressed in closed forms and the topological pressure is demonstrated explicitly for potential functions that depend on finitely many coordinates. According to these results, Parry measure is inferred to be an equilibrium measure.

View PDFchevron_right
Some properties of topological pressure on cellular automata
Chih-Hung Chang, Journal of Algebra Combinatorics Discrete Structures and Applications

This paper investigates the ergodicity and the power rule of the topological pressure of a cellular automaton. If a cellular automaton is either leftmost or rightmost permutive (due to the terminology given by Hedlund [Math. Syst. Theor. 3, 320-375, 1969]), then it is ergodic with respect to the uniform Bernoulli measure. More than that, the relation of topological pressure between the original cellular automaton and its power rule is expressed in a closed form. As an application, the topological pressure of a linear cellular automaton can be computed explicitly. 2010 MSC: 37B10

View PDFchevron_right

Related topics

  • Applied Mathematics
  • Potential Function
  • Topological Entropy
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved