Computing the closure of sets of words under partial commutations

DOI10.1007/3-540-60084-1_64zbMath1412.68133OpenAlexW1581738459MaRDI QIDQ4645168

Gwenaël Richomme, Pierre-André Wacrenier, Yves Métivier

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_64

zbMATH Keywords

rankcommutationrecognizabilitytrace monoidsstar problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Unnamed Item
• Unnamed Item
• On recognizable subsets of free partially commutative monoids
• Recognizable closures and submonoids of free partially commutative monoids
• Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
• Matrices de Hankel
• Semigroups, Presburger formulas, and languages
• Combinatorial problems of commutation and rearrangements
• ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS
• On regular compatibility of semi-commutations
• Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable
• Bounded Regular Sets

This page was built for publication: Computing the closure of sets of words under partial commutations