Computational Aspects of Cellular Automata on Countable Sofic Shifts

DOI10.1007/978-3-642-32589-2_67zbMath1365.68338OpenAlexW762790MaRDI QIDQ2912776

Ilkka Törmä, Jarkko Peltomäki

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_67

zbMATH Keywords

undecidabilitycellular automatasubshiftsnontransitivity

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (5)

Topological dynamics of nondeterministic cellular automata ⋮ A uniquely ergodic cellular automaton ⋮ Subshifts with sparse traces ⋮ A note on subgroups of automorphism groups of full shifts ⋮ Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2

This page was built for publication: Computational Aspects of Cellular Automata on Countable Sofic Shifts