Algorithmic decomposition of shuffle on words

DOI10.1016/J.TCS.2012.04.001zbMath1281.68142OpenAlexW2021596745MaRDI QIDQ714805

Ian McQuillan, Franziska Biegler, Mark Daley

Publication date: 11 October 2012

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

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

zbMATH Keywords

wordsfinite automatafinite languagesshuffle decomposition

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the complexity and decidability of some problems involving shuffle ⋮ Codes induced by alternative codes

Cites Work

• On the uniqueness of shuffle on words and finite languages
• Shuffle factorization is unique
• SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic decomposition of shuffle on words