scientific article; zbMATH DE number 4020497
[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.
- On regular trace languages
- On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
- Characterizations of the decidability of some problems for regular trace languages
- scientific article; zbMATH DE number 4051029
- scientific article; zbMATH DE number 3848633
- On regular trace languages
- Theory of traces
- On the decidability of the equivalence problem for partially commutative rational power series
- On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
- Two techniques in the area of the star problem in trace monoids
- The generalized rank of trace languages
- Unambiguous recognizable two-dimensional languages
- Unambiguity in Timed Regular Languages: Automata and Logics
- Trace languages defined by regular string languages
- Characterizations of the decidability of some problems for regular trace languages
- Logical definability of some rational trace languages
- scientific article; zbMATH DE number 7561705 (Why is no real title available?)
- Toward a Structure Theory of Regular Infinitary Trace Languages
- Developments in Language Theory
- Reordering Derivatives of Trace Closures of Regular Languages.
- On the inclusion problem for finitely ambiguous rational trace languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763601)