Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results

DOI10.1016/S0012-365X(98)00203-9zbMath0931.68073MaRDI QIDQ1297435

V. Pereyra

Publication date: 9 August 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (max. 100)

Progress, gaps and obstacles in the classification of cellular automata ⋮ Four states are enough! ⋮ Communication complexity meets cellular automata: necessary conditions for intrinsic universality ⋮ Bulking II: Classifications of cellular automata ⋮ Nilpotency and periodic points in non-uniform cellular automata

Cites Work

• Unnamed Item
• Classifying circular cellular automata
• Undecidability and nonperiodicity for tilings of the plane
• Remarks on Berger's paper on the domino problem
• On the Limit Sets of Cellular Automata
• The Nilpotency Problem of One-Dimensional Cellular Automata
• The undecidability of the domino problem

This page was built for publication: Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results