Skip to main content
Conference ProceedingsOPEN ACCESS

Groups and monoids of cellular automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9099 17-45
DOI: 10.1007/978-3-662-47221-7_3
8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Salo, V. (2015). Groups and monoids of cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9099, pp. 17–45). Springer Verlag. https://doi.org/10.1007/978-3-662-47221-7_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free