On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages (Q1322488)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages |
scientific article |
Statements
On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages (English)
0 references
1994
0 references
languages on partially commutative monoids
0 references
recognizable trace language
0 references
monoid automaton
0 references
finite state asynchronous automata
0 references
concurrency
0 references
concurrent alphabet
0 references
