Abstract
The shuffle of k words u 1,..., u k is the set of words obtained by interleaving the letters of these words such that the order of appearance of all letters of each word is respected. The study of the shuffle product of words leads to the construction of an automaton whose structure is deeply connected to a family of trees which we call araucarias. We prove many structural properties of this family of trees and give some combinatorial results. The link with the minimal partial automaton which recognizes the words of the shuffle is established. Our method works for the shuffle of k≥ 2 words.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allauzen, C.: Calcul efficace du shuffle de k mots, Prépublication de l’Institut Gaspard Monge, 36 (2000)
Berstel, J., Boasson, L.: Shuffle factorization is unique, Prépublication de l’Institut Gaspard Monge, 16 (1999)
Cori, R., Perrin, D.: Automates et commutations partielles. RAIRO Inf. Theor. 19, 21–32 (1985)
Diekert, V.: Combinatorics on Traces. LNCS, vol. 454. Springer, Heidelberg (1990)
Eilenberg, S.: Automata, Languages and Machines. Academic Press, London (1974)
Françon, J.: Une approche quantitative de l’exclusion mutuelle. Theoretical Informatics and Applications 20(3), 275–289 (1986)
Gómez, A.C., Pin, J.-E.: On a conjecture of Schnoebelen. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 35–54. Springer, Heidelberg (2003)
Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1982)
Mateescu, A.: Shuffle of ω-words: algebraic aspects. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 150–160. Springer, Heidelberg (1998)
Nivat, M., Ramkumar, G.D.S., Pandu Rangan, C., Saoudi, A., Sundaram, R.: Efficient parallel shuffle recognition. Parallel Processing Letters 4, 455–463 (1994)
Schnoebelen, P.: Decomposable regular languages and the shuffle operator. EATCS Bull 67, 283–289 (1999)
Schott, R., Spehner, J.-C.: Efficient generation of commutation classes. Journal of Computing and Information 2(1), 1110–1132 (1996) Special issue: Proceedings of Eighth International Conference of Computing and Information (ICCI 1996), Waterloo, Canada, June 19-22 (1996)
Schott, R., Spehner, J.-C.: Two optimal parallel algorithms on the commutation class of a word. Theoretical Computer Science 324, 107–131 (2004)
Spehner, J.-C.: Le calcul rapide des mélanges de deux mots. Theoretical Computer Science 47, 181–203 (1986)
Zielonka, W.: Notes on finite asynchronous automata and trace languages. RAIRO Inf. Theor. 21, 99–135 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schott, R., Spehner, JC. (2005). On the Minimal Automaton of the Shuffle of Words and Araucarias. In: Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2004. Lecture Notes in Computer Science, vol 3354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31834-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-31834-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25261-0
Online ISBN: 978-3-540-31834-7
eBook Packages: Computer ScienceComputer Science (R0)