Computing the closure of sets of words under partial commutations
From MaRDI portal
Recommendations
Cites work
- Bounded Regular Sets
- Combinatorial problems of commutation and rearrangements
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
- scientific article; zbMATH DE number 3970130 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- Matrices de Hankel
- On recognizable subsets of free partially commutative monoids
- On regular compatibility of semi-commutations
- ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS
- Recognizable closures and submonoids of free partially commutative monoids
- Semigroups, Presburger formulas, and languages
- Some trace monoids where both the star problem and the finite power property problem are decidable (extended abstract)
Cited in
(6)- The power of commuting with finite sets of words
- scientific article; zbMATH DE number 6004843 (Why is no real title available?)
- scientific article; zbMATH DE number 3970130 (Why is no real title available?)
- Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)
- Machines, Computations, and Universality
- A note on the commutative closure of star-free languages
This page was built for publication: Computing the closure of sets of words under partial commutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645168)
