One-way cellular automata on Cayley graphs

DOI10.1016/0304-3975(94)90236-4zbMath0821.68087OpenAlexW2033515910MaRDI QIDQ1334667

Zsuzsanna Róka

Publication date: 25 September 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90236-4

zbMATH Keywords

one-way cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (9)

The surjectivity problem for 2D cellular automata ⋮ Complexity of reachability problems for finite discrete dynamical systems ⋮ Reachability problems for sequential dynamical systems with threshold functions. ⋮ A universal cellular automaton in the hyperbolic plane. ⋮ Simulations between cellular automata on Cayley graphs ⋮ Predecessor existence problems for finite discrete dynamical systems ⋮ Parallel dynamical systems over special digraph classes ⋮ ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS ⋮ Parallel dynamical systems over graphs and related topics: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On real-time cellular automata and trellis automata
• Real-time language recognition by one-dimensional cellular automata
• One-way bounded cellular automata
• The Genus, Regional Number, and Betti Number of a Graph

This page was built for publication: One-way cellular automata on Cayley graphs