(Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata

DOI10.1007/978-3-642-03816-7_55zbMath1250.68206OpenAlexW1544302085MaRDI QIDQ3182963

Gaétan Richard

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_55

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items

A family of sand automata

Cites Work

• Unnamed Item
• From sandpiles to sand automata
• Games on line graphs and sand piles
• Reversibility and surjectivity problems of cellular automata
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Mathematical Foundations of Computer Science 2005