On shift spaces with algebraic structure

Authors:
Ville Salo;Ilkka Törmä
Affiliations:
Department of Mathematics, Turku, Finland;Department of Mathematics, Turku, Finland
Venue:
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Year:
2012

Citing 5
Cited 0

An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Ergodicity of linear cellular automata over Zm

Information Processing Letters
Invertible linear cellular automata over Zm: algorithmic and dynamical aspects

Journal of Computer and System Sciences
Ergodicity, transitivity, and regularity for linear cellular automata over Zm1

Theoretical Computer Science
Linear Cellular Automata with Multiple State Variables

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.