Groups and Monoids of Cellular Automata

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01442480
Contributor : Hal Ifip <>
Submitted on : Friday, January 20, 2017 - 4:09:35 PM
Last modification on : Wednesday, February 13, 2019 - 6:30:03 PM
Long-term archiving on : Friday, April 21, 2017 - 4:08:57 PM

File

338243_1_En_3_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

70

Files downloads

150