A search algorithm for subshift attractors of cellular automata
From MaRDI portal
Publication:968269
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- A Search Algorithm for the Maximal Attractor of a Cellular Automaton
- An Introduction to Symbolic Dynamics and Coding
- Combinatorial Pattern Matching
- Depth-First Search and Linear Graph Algorithms
- Minimal NFA Problems are Hard
- NFA reduction algorithms by means of regular inequalities
- On the Limit Sets of Cellular Automata
- On the measure attractor of a cellular automaton
- On the sofic limit sets of cellular automata
- Periodic points for onto cellular automata
- Re-describing an algorithm by Hopcroft
- Reducing NFAs by invariant equivalences.
- Rice's theorem for the limit sets of cellular automata
- Subshift attractors of cellular automata
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Theory Is Forever
Cited in
(2)
This page was built for publication: A search algorithm for subshift attractors of cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968269)