Shuffle factorization is unique

DOI10.1016/S0304-3975(00)00433-3MaRDI QIDQ1605326zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• More efficient shuffle argument from unique factorization
• scientific article; zbMATH DE number 5294578
• scientific article; zbMATH DE number 2087222
• A proof of the shuffle conjecture
• The shuffle conjecture
• The unique prime factorization
• scientific article; zbMATH DE number 818395
• The shuffle algebra on the factors of a word is free
• Walks around unique factorization
• scientific article; zbMATH DE number 1842502

Cites work

• scientific article; zbMATH DE number 417855 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• A constant time string shuffle algorithm on reconfigurable meshes
• A natural ring basis for the shuffle algebra and an application to group schemes
• Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)

Cited in

(7)

• On the uniqueness of shuffle on words and finite languages
• Decompositions of nonlinear input-output systems to zero the output
• Algorithmic decomposition of shuffle on words
• On Shuffle Ideals
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• The Frobenius problem for the shuffle operation
• Tree shuffle

This page was built for publication: Shuffle factorization is unique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1605326)