A note on cellular automata

MaRDI QIDQ5863330zbMATH OpenFDO

Authors

Publication date 11 March 2022

Full work available at URL https://arxiv.org/abs/1901.10160, http://www.advgrouptheory.com/journal/Files/click_url.php?id=Volumes/12/Shahryari.pdf#vol12

zbMATH Keywords

cellular automatadynamical systemsymbolic dynamic

Mathematics Subject Classification ID

Other groups related to topology or analysis (20F38) Dynamical aspects of cellular automata (37B15)

Abstract: For an arbitrary group $G$ and arbitrary set $A$, we define a monoid structure on the set of all uniformly continuous functions $A^{G}oA$ and then we show that it is naturally isomorphic to the monoid of cellular automata $mathrmCA(G,A)$. This gives a new equivalent definition of a cellular automaton over the group $G$ with alphabet set $A$. We use this new interpretation to give a simple proof of the theorem of Curtis-Hedlund.

Recommendations

• Cellular automata are the continuous self-mappings of configuration spaces
• Cellular automata on a G-set
• A generalization of the Curtis-Hedlund theorem
• A generalization of cellular automata over groups
• Groups and Monoids of Cellular Automata

Cites work

• Cellular automata and groups
• scientific article; zbMATH DE number 3234211 (Why is no real title available?)

Cited in

(5)

• Remark on cellular automata and shift preserving maps
• Cellular automata are the continuous self-mappings of configuration spaces
• scientific article; zbMATH DE number 1210087 (Why is no real title available?)
• Cellular automata on a G-set
• Further results on generalized cellular automata

This page was built for publication: A note on cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863330)