Recognizable languages in concurrency monoids

DOI10.1016/0304-3975(94)00266-LMaRDI QIDQ672317zbMATH OpenWikidataFDO

Authors Manfred Droste

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)00266-L

zbMATH Keywords

automatatransition systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A kleene theorem for recognizable languages over concurrency monoids
• Aperiodic languages in concurrency monoids
• Recognizable and logically definable languages of infinite computations in concurrent automata
• Dependence orders for computations of concurrent automata
• Representation of computations in concurrent automata by dependence orders

Cites work

• A kleene theorem for recognizable languages over concurrency monoids
• Aperiodic languages in concurrency monoids
• Combinatorics on traces
• Compositional relational semantics for indeterminate dataflow networks
• CONCURRENT AUTOMATA AND DOMAINS
• Concurrent Machines
• Concurrent transition systems
• Connections between a concrete and an abstract model of concurrent systems
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Defining conditional independence using collapses
• From domains to automata with concurrency
• scientific article; zbMATH DE number 3970130 (Why is no real title available?)
• scientific article; zbMATH DE number 4024793 (Why is no real title available?)
• scientific article; zbMATH DE number 4060692 (Why is no real title available?)
• scientific article; zbMATH DE number 4074504 (Why is no real title available?)
• scientific article; zbMATH DE number 3735770 (Why is no real title available?)
• scientific article; zbMATH DE number 177814 (Why is no real title available?)
• scientific article; zbMATH DE number 554482 (Why is no real title available?)
• scientific article; zbMATH DE number 1456962 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• Labelled domains and automata with concurrency
• Minimal and Optimal Computations of Recursive Programs
• On the definition of a family of automata
• Recognizable subsets of some partially Abelian monoids
• Star-free trace languages
• Theory of traces
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif

Cited in

(16)

• Languages recognized by programs over the two-element monoid
• Representation of computations in concurrent automata by dependence orders
• Synchronization expressions with extended join operation
• Complete positive group presentations.
• The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
• Aperiodic languages in concurrency monoids
• Finite transducers for divisibility monoids
• CONCURRENT AUTOMATA AND DOMAINS
• Topology for Computations of Concurrent Automata
• Recognizable languages in divisibility monoids
• Dependence orders for computations of concurrent automata
• A Kleene theorem for recognizable languages over concurrency monoids
• scientific article; zbMATH DE number 1390068 (Why is no real title available?)
• Recognizable and logically definable languages of infinite computations in concurrent automata
• Synthesis of Safe Message-Passing Systems
• Languages and logical definability in concurrency monoids

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)