Shuffle factorization is unique

DOI10.1016/S0304-3975(00)00433-3zbMath0997.68092OpenAlexW2008734340MaRDI QIDQ1605326

Jean Berstel, Luc Boasson

Publication date: 15 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00433-3

zbMATH Keywords

shuffle

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (6)

On the uniqueness of shuffle on words and finite languages ⋮ Tree shuffle ⋮ On the complexity and decidability of some problems involving shuffle ⋮ SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES ⋮ On Shuffle Ideals ⋮ Algorithmic decomposition of shuffle on words

Cites Work

• Unnamed Item
• Unnamed Item
• Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
• A natural ring basis for the shuffle algebra and an application to group schemes
• A constant time string shuffle algorithm on reconfigurable meshes

This page was built for publication: Shuffle factorization is unique