Abstract
AbstractNilpotent cellular automata have the simplest possible dynamics: all initial configurations lead in bounded time into the unique fixed point of the system. We investigate nilpotency in the setup of one-dimensional non-uniform cellular automata (NUCA) where different cells may use different local rules. There are infinitely many cells in NUCA but only a finite number of different local rules. Changing the distribution of the local rules in the system may drastically change the dynamics. We prove that if the available local rules are such that every periodic distribution of the rules leads to nilpotent behavior then so do also all eventually periodic distributions. However, in some cases there may be non-periodic distributions that are not nilpotent even if all periodic distributions are nilpotent. We demonstrate such a possibility using aperiodic Wang tile sets. We also investigate temporally periodic points in NUCA. In contrast to classical uniform cellular automata, there are NUCA—even reversible equicontinuous ones—that do not have any temporally periodic points. We prove the undecidability of this property: there is no algorithm to determine if a NUCA with a given finite distribution of local rules has a periodic point.
Funder
Academy of Finland
SPARC, Government of India
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference20 articles.
1. Aanderaa, S., Lewis, H.: Linear sampling and the $$\forall \exists \forall $$ case of the decision problem. J. Symb. Log. 39(3), 519–548 (1974)
2. Berger, R.: The Undecidability of the Domino Problem. Memoirs of the American Mathematical Society. American Mathematical Society, Providence (1966)
3. Boyle, M.: Open problems in symbolic dynamics. In: Brin, M., Burns, K., Dolgopyat, D., Pesin, Y. (eds.) Geometric and Probabilistic Structures in Dynamics, Contemporary Mathematics, vol. 469, pp. 69–118. American Mathematical Society, Providence (2008)
4. Boyle, M., Maass, A.: Expansive invertible onesided cellular automata. J. Math. Soc. Jpn. 52(4), 725–740 (2000)
5. Springer Monographs in Mathematics;T Ceccherini-Silberstein,2010
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献