Linear cellular automata and decidability

DOI10.1007/978-3-319-09039-9_12MaRDI QIDQ4982999zbMATH OpenOpenAlexFDO

Authors K. Sutner

Publication date 14 April 2015

Published in Automata, Universality, Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09039-9_12

zbMATH Keywords

cellular automatondecidabilityundecidability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Cellular automata (computational aspects) (68Q80)

Recommendations

• Cellular automata, decidability and phasespace
• Decidability and undecidability in cellular automata
• On decidability properties of one-dimensional cellular automata
• scientific article; zbMATH DE number 2113941
• Classifying circular cellular automata

Cited in

(24)

• Frontier between decidability and undecidability: A survey
• Linear cellular automata with boundary conditions
• Elementary, finite and linear vN-regular cellular automata
• On the dynamical behaviour of linear higher-order cellular automata and its decidability
• Decidability of sensitivity and equicontinuity for linear higher-order cellular automata
• scientific article; zbMATH DE number 1665453 (Why is no real title available?)
• Decidability and undecidability in cellular automata
• On decidability properties of one-dimensional cellular automata
• Cellular automata, decidability and phasespace
• Towards the frontier between decidability and undecidability for hyperbolic cellular automata
• Model checking one-dimensional cellular automata
• scientific article; zbMATH DE number 3972191 (Why is no real title available?)
• scientific article; zbMATH DE number 4030989 (Why is no real title available?)
• scientific article; zbMATH DE number 4074492 (Why is no real title available?)
• scientific article; zbMATH DE number 522847 (Why is no real title available?)
• scientific article; zbMATH DE number 2113941 (Why is no real title available?)
• scientific article; zbMATH DE number 7339761 (Why is no real title available?)
• More decision algorithms for global properties of 1D cellular automata
• Cellular automata: descriptional complexity and decidability
• A decidability result for the halting of cellular automata on the pentagrid
• A note on decidability of cellularity
• Structure and computability of preimages in the Game of Life
• Classifying circular cellular automata
• The immortality problem for Lag systems

This page was built for publication: Linear cellular automata and decidability

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