Abstract : We discuss groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal subshifts, countable subshifts and coded and synchronized systems. Both purely group-theoretic properties and issues of decidability are considered.
https://hal.inria.fr/hal-01442480 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Friday, January 20, 2017 - 4:09:35 PM Last modification on : Wednesday, May 6, 2020 - 8:18:02 PM Long-term archiving on: : Friday, April 21, 2017 - 4:08:57 PM
Ville Salo. Groups and Monoids of Cellular Automata. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.17-45, ⟨10.1007/978-3-662-47221-7_3⟩. ⟨hal-01442480⟩