scientific article; zbMATH DE number 1456962

MaRDI QIDQ4954451zbMATH OpenFDO

Authors Dietrich Kuske

Publication date 7 June 2000

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 177814
• CONCURRENT AUTOMATA AND DOMAINS
• From domains to automata with concurrency

Cited in

(9)

• Representation of computations in concurrent automata by dependence orders
• Stable trace automata vs. full trace automata
• Asynchronous games. II: The true concurrency of innocence
• Directed homotopy in non-positively curved spaces
• CONCURRENT AUTOMATA AND DOMAINS
• scientific article; zbMATH DE number 177814 (Why is no real title available?)
• A Kleene theorem for recognizable languages over concurrency monoids
• Languages and logical definability in concurrency monoids
• Recognizable languages in concurrency monoids

This page was built for publication:

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