Symbolic Dynamics, Flower Automata and Infinite Traces
DOI10.1007/978-3-642-18098-9_15zbMATH Open1226.68053OpenAlexW1579250203MaRDI QIDQ3073631FDOQ3073631
Authors: Wit Foryś, Piotr Oprocha, Sławomir Bakalarski 
Publication date: 11 February 2011
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_15
Recommendations
- Infinite traces and symbolic dynamics
- Symbolic dynamics and finite automata
- Applications of symbolic dynamics on an infinite alphabet
- Infinite traces and symbolic dynamics -- the minimal shift case
- Computable symbolic dynamics
- Computability in Symbolic Dynamics
- Symbolic dynamics and nonlinear semiflows
- Symbolic flow and its applications
- Publication:4863693
- scientific article; zbMATH DE number 2103120
Formal languages and automata (68Q45) Symbolic dynamics (37B10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Combinatorics on traces
- Title not available (Why is that?)
- Combinatorial problems of commutation and rearrangements
- A metric for traces
- Notes on Renewal Systems
- A dynamical model of parallel computation on bi-infinite time-scale
- Infinite traces and symbolic dynamics
- Finitely generated sofic systems
- Infinite traces and symbolic dynamics -- the minimal shift case
Cited In (2)
This page was built for publication: Symbolic Dynamics, Flower Automata and Infinite Traces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073631)
