Symbolic dynamics and finite automata
From MaRDI portal
Publication:3569002
DOI10.1007/3-540-60246-1_116zbMATH Open1193.68157OpenAlexW3100945774MaRDI QIDQ3569002FDOQ3569002
Publication date: 17 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60246-1_116
Cited In (11)
- Title not available (Why is that?)
- Symbolic Dynamics, Flower Automata and Infinite Traces
- Symbolic dynamics and characterization of complexity
- Title not available (Why is that?)
- Finite automata-models for the investigation of dynamical systems
- Computational complementarity and shift spaces
- Enumerative sequences of leaves in rational trees
- General Framework
- Framed Versus Unframed Two-Dimensional Languages
- Forbidden words in symbolic dynamics
- Dynamical aspects of \(\sigma\)-machines
Recommendations
- Theoretical Aspects of Symbolic Automata π π
- Title not available (Why is that?) π π
- Computable symbolic dynamics π π
- Computability in Symbolic Dynamics π π
- Title not available (Why is that?) π π
- Applications of Symbolic Finite Automata π π
- Symbolic Dynamics, Flower Automata and Infinite Traces π π
- Symbolic methods and automata π π
- Title not available (Why is that?) π π
This page was built for publication: Symbolic dynamics and finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569002)