Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
From MaRDI portal
Publication:1297435
DOI10.1016/S0012-365X(98)00203-9zbMath0931.68073MaRDI QIDQ1297435
Publication date: 9 August 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items
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