Idempotent cellular automata and their natural order
Abstract: Motivated by the search for idempotent cellular automata (CA), we study CA that act almost as the identity unless they read a fixed pattern $p$. We show that constant and symmetrical patterns always produce idempotent CA, and we characterize the quasi-constant patterns that produce idempotent CA. Our results are valid for CA over an arbitrary group $G$. Moreover, we study the semigroup theoretic natural partial order defined on idempotent CA. If $G$ is infinite, we prove that there is an infinite independent set of idempotent CA, and if $G$ has an element of infinite order, we prove that there is an infinite increasing chain of idempotent CA.
- Hartwig, R. E.: How to partially order regular elements. Math. Japonica 25(1) (1980) 1–13.
- Hedlund, G. A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3 (1969) 320–375. https://doi.org/10.1007/BF01691062
- Howie, J. M.: The Subsemigroup Generated By the Idempotents of a Full Transformation Semigroup. J. London Math. Soc. s1-41 (1966) 707-716. https://doi.org/10.1112/jlms/s1-41.1.707
- Kari, J.: Theory of cellular automata: a survey. Theoretical Computer Science 334 (2005) 3 – 33. https://doi.org/10.1016/j.tcs.2004.11.021
- Mitsch, H.: A natural partial order for semigroups. Proc. Amer. Math. Soc. 97(3) (1986) 384–388. https://doi.org/10.2307/2046222
- Nambooripad K. S. S.: The natural partial order on a regular semigroup. Proc. Edinburgh Math. Soc. 23(3) (1980) 249–260. https://doi.org/10.1017/S0013091500003801
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
