1. Berstel, J., Boasson, L.: Shuffle factorization is unique. Theoretical Computer Science 273, 47–67 (2002)
2. Biegler, F.: Decomposition and Descriptional Complexity of Shuffle on Words and Finite Languages. Ph.D. thesis, University of Western Ontario, London, Canada (2009)
3. Biegler, F., Daley, M., Holzer, M., McQuillan, I.: On the uniqueness of shuffle on words and finite languages. Theoretical Computer Science 410, 3711–3724 (2009)
4. Biegler, F., Daley, M., McQuillan, I.: On the shuffle automaton size for words. Journal of Automata, Languages and Combinatorics 15, 53–70 (2010)
5. Biegler, F., Daley, M., McQuillan, I.: Algorithmic decomposition of shuffle on words. Theoretical Computer Science 454, 38–50 (2012)