Languages and logical definability in concurrency monoids

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

Manfred Droste, Dietrich Kuske

Publication date: 21 June 2024

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

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