Groups and Monoids of Cellular Automata




Salo V

Kari J.

International Workshop on Cellular Automata and Discrete Complex Systems

PublisherSPRINGER-VERLAG NEW YORK, MS INGRID CUNNINGHAM, 175 FIFTH AVE, NEW YORK, NY 10010 USA

Berlin

2015

Cellular Automata and Discrete Complex Systems. AUTOMATA 2015

CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS, AUTOMATA 2015

LECT NOTES COMPUT SC

Lecture Notes in Computer Science

9099

17

45

29

978-3-662-47220-0

978-3-662-47221-7

0302-9743

DOIhttps://doi.org/10.1007/978-3-662-47221-7_3



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.

Last updated on 2024-26-11 at 23:43