Groups and Monoids of Cellular Automata
Pysyvä osoite
Verkkojulkaisu
Tiivistelmä
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.
Sarja
Lecture Notes in Computer Science