Decidability in Group Shifts and Group Cellular Automata

DOI10.4230/LIPIcs.MFCS.2020.12OpenAlexW3082621986MaRDI QIDQ5089173

Pierre Béaur, Jarkko Kari

Publication date: 18 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2020.12

zbMATH Keywords

symbolic dynamicsdecidabilitygroup shiftsgroup cellular automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the dynamics and recursive properties of multidimensional symbolic systems
• Reversibility and surjectivity problems of cellular automata
• Theory of cellular automata: a survey
• On the dynamical behaviour of linear higher-order cellular automata and its decidability
• Automorphisms of compact groups
• Cellular Automata and Groups
• Periodicity and Immortality in Reversible Computing
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Linear sampling and the ∀∃∀ case of the decision problem
• An Introduction to Symbolic Dynamics and Coding
• Endomorphisms and automorphisms of the shift dynamical system
• Dynamical systems of algebraic origin

This page was built for publication: Decidability in Group Shifts and Group Cellular Automata