Languages and logical definability in concurrency monoids

DOI10.1007/3-540-61377-3_41zbMATH Open1540.68119MaRDI QIDQ6560171FDOQ6560171

Authors: Manfred Droste, Dietrich Kuske 

Publication date: 21 June 2024

Recommendations

• Recognizable and logically definable languages of infinite computations in concurrent automata
• Recognizable languages in concurrency monoids
• Aperiodic languages in concurrency monoids
• A kleene theorem for recognizable languages over concurrency monoids
• scientific article; zbMATH DE number 512855

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Concurrent Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorics on traces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Weak Second‐Order Arithmetic and Finite Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• CONCURRENT AUTOMATA AND DOMAINS
• Title not available (Why is that?)
• Theory of traces
• Star-free trace languages
• Labelled domains and automata with concurrency
• Title not available (Why is that?)
• From domains to automata with concurrency
• Title not available (Why is that?)
• Compositional relational semantics for indeterminate dataflow networks
• Title not available (Why is that?)
• Dependence orders for computations of concurrent automata
• Logical definability on infinite traces
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Languages and logical definability in concurrency monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560171)