Decidability in Group Shifts and Group Cellular Automata

DOI10.4230/LIPICS.MFCS.2020.12OpenAlexW3082621986MaRDI QIDQ5089173FDOQ5089173

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

symbolic dynamicsdecidabilitygroup shiftsgroup cellular automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (2)

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

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)