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

DOI10.1142/s0129054123480040arXiv2301.11133MaRDI QIDQ6154975

Jarkko Kari, Pierre Béaur

Publication date: 16 February 2024

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

Full work available at URL: https://arxiv.org/abs/2301.11133

zbMATH Keywords

symbolic dynamicsdecidabilitygroup shiftgroup cellular automata

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Symbolic dynamics (37B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Periodic points for onto cellular automata
• On the dynamics and recursive properties of multidimensional symbolic systems
• Reversibility and surjectivity problems of cellular automata
• Some properties of cellular automata with equicontinuity points
• Theory of cellular automata: a survey
• Cellular automata and strongly irreducible shifts of finite type.
• Solution of some conjectures about topological properties of linear cellular automata
• Dynamical behavior of additive cellular automata over finite abelian groups
• On the dynamical behaviour of linear higher-order cellular automata and its decidability
• Automorphisms of compact groups
• Multidimensional cellular automata and generalization of Fekete's lemma
• 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
• Decidability in Group Shifts and Group Cellular Automata
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Endomorphisms and automorphisms of the shift dynamical system
• Dynamical systems of algebraic origin

This page was built for publication: Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata