Recognizable languages in concurrency monoids
From MaRDI portal
Publication:672317
DOI10.1016/0304-3975(94)00266-LzbMATH Open0874.68167WikidataQ126321978 ScholiaQ126321978MaRDI QIDQ672317FDOQ672317
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Concurrent Machines
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Combinatorics on traces
- Recognizable subsets of some partially Abelian monoids
- On the definition of a family of automata
- Minimal and Optimal Computations of Recursive Programs
- CONCURRENT AUTOMATA AND DOMAINS
- Theory of traces
- Concurrent transition systems
- Star-free trace languages
- Defining conditional independence using collapses
- Labelled domains and automata with concurrency
- Aperiodic languages in concurrency monoids
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
- From domains to automata with concurrency
- A kleene theorem for recognizable languages over concurrency monoids
- Compositional relational semantics for indeterminate dataflow networks
- Connections between a concrete and an abstract model of concurrent systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Title not available (Why is that?)
- Finite transducers for divisibility monoids
- Representation of computations in concurrent automata by dependence orders
- Languages recognized by programs over the two-element monoid
- Aperiodic languages in concurrency monoids
- Synchronization expressions with extended join operation
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
- Topology for Computations of Concurrent Automata
- Recognizable languages in divisibility monoids
- A kleene theorem for recognizable languages over concurrency monoids
- CONCURRENT AUTOMATA AND DOMAINS
- Complete positive group presentations.
- Synthesis of Safe Message-Passing Systems
This page was built for publication: Recognizable languages in concurrency monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672317)
