The Garden of Eden Theorem for Cellular Automata on Group Sets

DOI10.1007/978-3-319-44365-2_7zbMath1392.68279arXiv1603.07272OpenAlexW3101407231MaRDI QIDQ4571171

Simon Wacker

Publication date: 6 July 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.07272

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (2)

Cellular automata on group sets and the uniform Curtis-Hedlund-Lyndon theorem ⋮ Right amenable left group sets and the Tarski-FØlner theorem

Cites Work

• Unnamed Item
• Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem
• Cellular Automata and Groups
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem

This page was built for publication: The Garden of Eden Theorem for Cellular Automata on Group Sets