Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
From MaRDI portal
Publication:1099640
DOI10.1016/0304-3975(86)90145-3zbMath0638.68081OpenAlexW2086683111MaRDI QIDQ1099640
Publication date: 1986
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90145-3
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (5)
On recognising words that are squares for the shuffle product ⋮ Algorithmic and algebraic aspects of unshuffling permutations ⋮ On Shuffle Ideals ⋮ Recognizing binary shuffle squares is \textsf{NP}-hard ⋮ Shuffle factorization is unique
Cites Work
This page was built for publication: Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
