Aperiodic languages in concurrency monoids

DOI10.1006/inco.1996.0039zbMath0853.68132OpenAlexW1977150987MaRDI QIDQ1917099

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

labelled transition systemsautomata with concurrency relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On aperiodic and star-free formal power series in partially commuting variables ⋮ Recognizable languages in concurrency monoids ⋮ Representation of computations in concurrent automata by dependence orders

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