Recognizable languages in concurrency monoids
From MaRDI portal
Publication:672317
DOI10.1016/0304-3975(94)00266-LzbMath0874.68167WikidataQ126321978 ScholiaQ126321978MaRDI QIDQ672317
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (9)
Complete positive group presentations. ⋮ Topology for Computations of Concurrent Automata ⋮ A kleene theorem for recognizable languages over concurrency monoids ⋮ Finite transducers for divisibility monoids ⋮ Synthesis of Safe Message-Passing Systems ⋮ Representation of computations in concurrent automata by dependence orders ⋮ Synchronization expressions with extended join operation ⋮ RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA ⋮ The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of traces
- Concurrent transition systems
- Combinatorics on traces
- Star-free trace languages
- Defining conditional independence using collapses
- Labelled domains and automata with concurrency
- Aperiodic languages in concurrency monoids
- 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
- CONCURRENT AUTOMATA AND DOMAINS
- Minimal and Optimal Computations of Recursive Programs
- From domains to automata with concurrency
- A kleene theorem for recognizable languages over concurrency monoids
- 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
This page was built for publication: Recognizable languages in concurrency monoids
