No label defined (Q3763601)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4020497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4020497 |
Statements
1986
0 references
regular languages
0 references
0.8762530088424683
0 references
0.8226987719535828
0 references
0.8226987719535828
0 references
[For the entire collection see Zbl 0593.00024.] It is a known result that so called unambiguous regular languages [\textit{S. Eilenberg} and \textit{M. Schützenberger}, Rational sets in commutative monoids, J. Algebra 13, 173-191 (1969; Zbl 0206.027)] coincide with the whole class of regular languages both in the case of fully commutative and of non-commutative monoids. In this paper these two classes of languages are compared in the case of partially commutative monoids represented here by traces of [\textit{A. Mazurkiewicz}, Concurrent program schemes and their interpretations, DAIMI PB-78, Aarhus Univ. Press (1977)]. The main result is that these two classes coincide if and only if the independence relation is transitive.
0 references