Simulations between cellular automata on Cayley graphs

DOI10.1016/S0304-3975(97)00213-2zbMath0930.68091OpenAlexW2162551654MaRDI QIDQ1960656

Zsuzsanna Róka

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00213-2

zbMATH Keywords

cellular automataCayley graphshomomorphismssimulations

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (8)

UNIVERSAL CELLULAR AUTOMATON OVER A HEXAGONAL TILING WITH 3 STATES ⋮ On time reduction and simulation in cellular spaces ⋮ Tilings: recursivity and regularity ⋮ A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior ⋮ Embeddings of dynamical systems into cellular automata ⋮ On the complexity of deadlock detection in families of planar nets ⋮ On the induction operation for shift subspaces and cellular automata as presentations of dynamical systems ⋮ Two-dimensional cellular automata recognizer

Cites Work

• One-way cellular automata on Cayley graphs
• Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simulations between cellular automata on Cayley graphs