A kleene theorem for recognizable languages over concurrency monoids

DOI10.1007/3-540-58201-0_84zbMath1418.68138OpenAlexW1582828320MaRDI QIDQ4632442

Manfred Droste

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_84

zbMATH Keywords

finite automatontrace theorycomputation sequencefinite word

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Recognizable languages in concurrency monoids ⋮ Directed Homotopy in Non-Positively Curved Spaces

Cites Work

• Recognizable languages in concurrency monoids
• Theory of traces
• Concurrent transition systems
• Combinatorics on traces
• Star-free trace languages
• Labelled domains and automata with concurrency
• Recognizable subsets of some partially Abelian monoids
• On the definition of a family of automata
• Concurrent Machines
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
• Notes on finite asynchronous automata
• CONCURRENT AUTOMATA AND DOMAINS
• Minimal and Optimal Computations of Recursive Programs
• From domains to automata with concurrency
• Compositional relational semantics for indeterminate dataflow networks
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Connections between a concrete and an abstract model of concurrent systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item