A search algorithm for subshift attractors of cellular automata
From MaRDI portal
Publication:968269
DOI10.1007/S00224-009-9230-6zbMATH Open1209.68172OpenAlexW2075756038MaRDI QIDQ968269FDOQ968269
Authors: Enrico Formenti, Petr Kůrka, 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
Recommendations
Cites Work
- Title not available (Why is that?)
- An Introduction to Symbolic Dynamics and Coding
- Depth-First Search and Linear Graph Algorithms
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- On the Limit Sets of Cellular Automata
- The Nilpotency Problem of One-Dimensional Cellular Automata
- Minimal NFA Problems are Hard
- Periodic points for onto cellular automata
- On the sofic limit sets of cellular automata
- Subshift attractors of cellular automata
- On the measure attractor of a cellular automaton
- Re-describing an algorithm by Hopcroft
- Reducing NFAs by invariant equivalences.
- Combinatorial Pattern Matching
- Theory Is Forever
- NFA reduction algorithms by means of regular inequalities
- A Search Algorithm for the Maximal Attractor of a Cellular Automaton
- Rice's theorem for the limit sets of cellular automata
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)
