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.
Jarkko Kari. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Springer, Lecture Notes in Computer Science, LNCS-9099, pp.17-45, 2015, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-662-47221-7_3〉
https://hal.inria.fr/hal-01442480
Contributeur : Hal Ifip
<>
Soumis le : vendredi 20 janvier 2017 - 16:09:35
Dernière modification le : lundi 23 janvier 2017 - 14:09:12
Document(s) archivé(s) le : vendredi 21 avril 2017 - 16:08:57
Ville Salo. Groups and Monoids of Cellular Automata. Jarkko Kari. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Springer, Lecture Notes in Computer Science, LNCS-9099, pp.17-45, 2015, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-662-47221-7_3〉. 〈hal-01442480〉
