On the Minimal Automaton of the Shuffle of Words and Araucarias - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

On the Minimal Automaton of the Shuffle of Words and Araucarias

Abstract

The shuffle of k words u1,..., uk 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.

Dates and versions

inria-00000273 , version 1 (21-09-2005)

Identifiers

Cite

René Schott, Jean-Claude Spehner. On the Minimal Automaton of the Shuffle of Words and Araucarias. 4th International Conference on Machines, Computations and Universality - MCU 2004, Sep 2004, Saint Petersburg, Russia, pp.316-327, ⟨10.1007/b106980⟩. ⟨inria-00000273⟩
59 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More