Symbolic Dynamics, Flower Automata and Infinite Traces

DOI10.1007/978-3-642-18098-9_15MaRDI QIDQ3073631zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• A dynamical model of parallel computation on bi-infinite time-scale
• A metric for traces
• Combinatorial problems of commutation and rearrangements
• Combinatorics on traces
• Finitely generated sofic systems
• Infinite traces and symbolic dynamics
• Infinite traces and symbolic dynamics -- the minimal shift case
• Notes on Renewal Systems

Cited in

(2)

• Infinite traces and symbolic dynamics -- the minimal shift case
• Symbolic dynamics and finite automata

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)