On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages

DOI10.1006/inco.1994.1010zbMath0804.68078OpenAlexW2047312296WikidataQ61677539 ScholiaQ61677539MaRDI QIDQ1322488

Danilo Bruschi, Nicoletta Sabadini, Giovanni Pighizzini

Publication date: 1994

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

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

zbMATH Keywords

concurrencyconcurrent alphabetfinite state asynchronous automatalanguages on partially commutative monoidsmonoid automatonrecognizable trace language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (3)

Probabilistic asynchronous automata ⋮ Basic notions of universal algebra for language theory and graph grammars ⋮ Model matching of switched asynchronous sequential machines via matrix approach

This page was built for publication: On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages