1999/01/01 by Tullio Ceccherini‐Silberstein, Antonio Machı̀, Fabio Scarabotti · 1 citation
Computer Science · #Cellular Automata and Applications #Computability, Logic, AI Algorithms #Cellular automaton #Computer science #Automaton #Theoretical computer science #Artificial intelligence
paper · pdf · doi:10.5802/aif.1686
openalex publication_date 1999/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11
We show that the theorems of Moore and Myhill hold for cellular automata whose universes are Cayley graphs of amenable finitely generated groups. This extends the analogous result of A. Machi and F. Mignosi “Garden of Eden configurations for cellular automata on Cayley graphs of groups” for groups of sub-exponential growth.