Symbolic Dynamics, Flower Automata and Infinite Traces

DOI10.1007/978-3-642-18098-9_15zbMath1226.68053OpenAlexW1579250203MaRDI QIDQ3073631

Wit Foryś, Sławomir Bakalarski, Piotr Oprocha

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Symbolic dynamics (37B10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• A dynamical model of parallel computation on bi-infinite time-scale
• Infinite traces and symbolic dynamics
• A metric for traces
• Combinatorics on traces
• Finitely generated sofic systems
• Combinatorial problems of commutation and rearrangements
• Notes on Renewal Systems

This page was built for publication: Symbolic Dynamics, Flower Automata and Infinite Traces