Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups

DOI10.1137/0406004MaRDI QIDQ5285936zbMATH OpenOpenAlexFDO

Authors Antonio Machì, Filippo Mignosi

Publication date 29 June 1993

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0406004

zbMATH Keywords

tessellationCayley graphsautomatagrowth functionfree abelian groupGarden of Eden configurations

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Cellular automata (computational aspects) (68Q80)

Recommendations

• Amenable groups and cellular automata
• The Garden of Eden theorem for cellular automata on group sets
• Gardens of Eden and amenability on cellular automata
• About the Garden of Eden theorems for cellular automata in the hyperbolic plane

Cited in

(37)

• PERIODIC CONFIGURATIONS OF SUBSHIFTS ON GROUPS
• Induced Subshifts and Cellular Automata
• Pre-expansivity in cellular automata
• A simulation of cellular automata on hexagons by cellular automata on rings
• The Garden of Eden theorem over generalized cellular automata
• On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems
• The firing squad synchronization problem on Cayley graphs
• scientific article; zbMATH DE number 2128182 (Why is no real title available?)
• Semi-strongly irreducible shifts
• Surjunctivity and reversibility of cellular automata over concrete categories
• Groups, graphs, languages, automata, games and second-order monadic logic
• Amenability of groups and \(G\)-sets
• The Moore-Myhill pseudo tiling for the Heisenberg tessellation automata
• On algebraic structure of neighborhoods of cellular automata -- horse power problem
• Induction and restriction of cellular automata
• A garden of Eden theorem for Anosov diffeomorphisms on tori
• Propagation, diffusion and randomization in cellular automata
• Amenability and Linear Cellular Automata Over Semisimple Modules of Finite Length
• Amenability of groups is characterized by Myhill's theorem
• Linear cellular automata on Cayley graphs
• A single-copy minimal-time simulation of a torus of automata by a ring of automata
• Gardens of Eden and amenability on cellular automata
• About the Garden of Eden theorems for cellular automata in the hyperbolic plane
• On dual surjunctivity and applications
• Amenable groups and cellular automata
• Embeddings of dynamical systems into cellular automata
• Cellular non-deterministic automata and partial differential equations
• Cellular automata and strongly irreducible shifts of finite type.
• Weak Gardens of Eden for 1-dimensional tessellation automata
• The Myhill property for cellular automata on amenable semigroups
• Homoclinically expansive actions and a garden of Eden theorem for harmonic models
• On problems related to growth, entropy, and spectrum in group theory
• Garden of Eden and specification
• Simulations between cellular automata on Cayley graphs
• A survey of cellular automata: types, dynamics, non-uniformity and applications
• CELLULAR AUTOMATA OVER SEMI-DIRECT PRODUCT GROUPS: REDUCTION AND INVERTIBILITY RESULTS
• Stationary Eden model on Cayley graphs

This page was built for publication: Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285936)