Recognizable closures and submonoids of free partially commutative monoids

DOI10.1016/0304-3975(91)90019-XzbMath0737.68051MaRDI QIDQ1178709

Kosaburo Hashiguchi

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

partially commutative monoidrecognizable sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05)

Related Items

Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable, The Generalized Rank of Trace Languages, On regular compatibility of semi-commutations, Reordering Derivatives of Trace Closures of Regular Languages., Two recognizable string-matching problems over free partially commutative monoids, Computing the closure of sets of words under partial commutations, Decidability of the star problem in \(A^*\times{}\{ b\}^*\), String matching problems over free partially commutative monoids, An extension of Kleene's and Ochmański's theorems to infinite traces

Cites Work

• Unnamed Item
• Unnamed Item
• On some equations in free partially commutative monoids
• On the decidability of some problems about rational subsets of free partially commutative monoids
• On recognizable subsets of free partially commutative monoids
• Recognizable subsets of some partially Abelian monoids
• Combinatorial problems of commutation and rearrangements
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
• Notes on finite asynchronous automata