A note on cellular automata

zbMATH Open1492.37017arXiv1901.10160MaRDI QIDQ5863330FDOQ5863330

Authors:

Publication date: 11 March 2022

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.

Full work available at URL: https://arxiv.org/abs/1901.10160

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

zbMATH Keywords

cellular automatadynamical systemsymbolic dynamic

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Cellular automata and groups

Cited In (4)

• Cellular automata are the continuous self-mappings of configuration spaces
• Remark on cellular automata and shift preserving maps
• 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)