ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS

From MaRDI portal

Revision as of 01:18, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4007855

Jump to:navigation, search

DOI10.1142/S0129054191000169zbMath0801.20041MaRDI QIDQ4007855

Brigitte Rozoy, Yves Métivier

Publication date: 27 September 1992

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

congruence connected graph traces commutation finite alphabet free monoid star operations free partially commutative monoid recognizable subsets connected iterative factor recognizable closure

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Subalgebras, congruence relations (08A30)

Related Items (4)

Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable ⋮ Computing the closure of sets of words under partial commutations ⋮ Decidability of the star problem in \(A^*\times{}\{ b\}^*\) ⋮ An extension of Kleene's and Ochmański's theorems to infinite traces

This page was built for publication: ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4007855&oldid=17704716"