Abstract
We investigate subshifts with a general algebraic structure and cellular automata on them, with an emphasis on (order-theoretic) lattices. Our main results concern the characterization of Boolean algebraic subshifts, conditions for algebraic subshifts to be recoded into cellwise algebras and the limit dynamics of homomorphic cellular automata on lattice subshifts. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Salo, V., & Törmä, I. (2012). On shift spaces with algebraic structure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7318 LNCS, pp. 636–645). https://doi.org/10.1007/978-3-642-30870-3_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
