Aperiodic languages in concurrency monoids

DOI10.1006/INCO.1996.0039MaRDI QIDQ1917099zbMATH OpenOpenAlexFDO

Authors Manfred Droste

Publication date 12 December 1996

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1996.0039

zbMATH Keywords

automata with concurrency relationslabelled transition systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Recognizable languages in concurrency monoids
• A kleene theorem for recognizable languages over concurrency monoids
• scientific article; zbMATH DE number 176495
• Programs over aperiodic monoids
• A connection between concurrency and language theory
• scientific article; zbMATH DE number 3982543
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 50943
• Languages recognized by finite aperiodic groupoids
• Languages recognized by finite aperiodic groupoids

Cited in

(6)

• Representation of computations in concurrent automata by dependence orders
• A Kleene theorem for recognizable languages over concurrency monoids
• Recognizable and logically definable languages of infinite computations in concurrent automata
• Languages and logical definability in concurrency monoids
• Recognizable languages in concurrency monoids
• On aperiodic and star-free formal power series in partially commuting variables

This page was built for publication: Aperiodic languages in concurrency monoids

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