A search algorithm for subshift attractors of cellular automata
From MaRDI portal
Publication:968269
DOI10.1007/s00224-009-9230-6zbMath1209.68172MaRDI QIDQ968269
Petr Kůrka, Enrico Formenti, Ondřej Zahradník
Publication date: 5 May 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-009-9230-6
Cites Work
- Unnamed Item
- Periodic points for onto cellular automata
- NFA reduction algorithms by means of regular inequalities
- On the measure attractor of a cellular automaton
- Rice's theorem for the limit sets of cellular automata
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- Reducing NFAs by invariant equivalences.
- Re-describing an algorithm by Hopcroft
- On the Limit Sets of Cellular Automata
- A Search Algorithm for the Maximal Attractor of a Cellular Automaton
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Minimal NFA Problems are Hard
- On the sofic limit sets of cellular automata
- An Introduction to Symbolic Dynamics and Coding
- Subshift attractors of cellular automata
- Depth-First Search and Linear Graph Algorithms
- Combinatorial Pattern Matching
- Theory Is Forever