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

• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 177814 (Why is no real title available?)
• scientific article; zbMATH DE number 177823 (Why is no real title available?)
• scientific article; zbMATH DE number 3594646 (Why is no real title available?)
• scientific article; zbMATH DE number 554483 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 4119618 (Why is no real title available?)
• scientific article; zbMATH DE number 821282 (Why is no real title available?)
• scientific article; zbMATH DE number 849039 (Why is no real title available?)
• scientific article; zbMATH DE number 1456962 (Why is no real title available?)
• scientific article; zbMATH DE number 234028 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• CONCURRENT AUTOMATA AND DOMAINS
• Combinatorics on traces
• Compositional relational semantics for indeterminate dataflow networks
• Concurrent Machines
• Dependence orders for computations of concurrent automata
• From domains to automata with concurrency
• Labelled domains and automata with concurrency
• Logical definability on infinite traces
• Star-free trace languages
• Theory of traces
• Weak Second‐Order Arithmetic and Finite Automata

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)