On the uniqueness of shuffle on words and finite languages

DOI10.1016/J.TCS.2009.04.016MaRDI QIDQ837162zbMATH OpenOpenAlexFDO

Authors Franziska Biegler, Mark Daley, Markus Holzer, Ian McQuillan

Publication date 10 September 2009

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

Full work available at URL https://doi.org/10.1016/j.tcs.2009.04.016

zbMATH Keywords

uniquenessfinite languagesshuffle decompositionshuffle on words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Shuffle factorization is unique
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• scientific article; zbMATH DE number 2087222
• Algorithmic decomposition of shuffle on words
• Shuffle decomposition of regular languages

Cites work

• scientific article; zbMATH DE number 2087222 (Why is no real title available?)
• Prime Decompositions of Regular Languages
• Shuffle decomposition of regular languages
• Shuffle factorization is unique

Cited in

(4)

• Algorithmic decomposition of shuffle on words
• Language equations
• scientific article; zbMATH DE number 2087222 (Why is no real title available?)
• Tree shuffle

This page was built for publication: On the uniqueness of shuffle on words and finite languages

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