ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS
From MaRDI portal
Publication:4007855
DOI10.1142/S0129054191000169zbMath0801.20041MaRDI QIDQ4007855
Publication date: 27 September 1992
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
congruence; connected graph; traces; commutation; finite alphabet; free monoid; star operations; free partially commutative monoid; recognizable subsets; connected iterative factor; recognizable closure
68Q45: Formal languages and automata
20M14: Commutative semigroups
20M05: Free semigroups, generators and relations, word problems
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
08A30: Subalgebras, congruence relations
Related Items
Computing the closure of sets of words under partial commutations, Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable, Decidability of the star problem in \(A^*\times{}\{ b\}^*\), An extension of Kleene's and Ochmański's theorems to infinite traces