Decidability in Group Shifts and Group Cellular Automata

DOI10.4230/LIPICS.MFCS.2020.12MaRDI QIDQ5089173zbMATH OpenOpenAlexFDO

Authors 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

decidabilitygroup cellular automatagroup shiftssymbolic dynamics

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Automorphisms of compact groups
• Cellular automata and groups
• Dynamical systems of algebraic origin
• Endomorphisms and automorphisms of the shift dynamical system
• scientific article; zbMATH DE number 4086592 (Why is no real title available?)
• scientific article; zbMATH DE number 2042127 (Why is no real title available?)
• scientific article; zbMATH DE number 2046045 (Why is no real title available?)
• scientific article; zbMATH DE number 2158945 (Why is no real title available?)
• Linear sampling and the ∀∃∀ case of the decision problem
• On the dynamical behaviour of linear higher-order cellular automata and its decidability
• On the dynamics and recursive properties of multidimensional symbolic systems
• Periodicity and Immortality in Reversible Computing
• Reversibility and surjectivity problems of cellular automata
• Sensitivity and topological mixing are undecidable for reversible one-dimensional cellular automata
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Theory of cellular automata: a survey

Cited in

(2)

• Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
• Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089173)