Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: SPECIAL ISSUE MCU2004
Article type: Research Article
Authors: Schott, René | Spehner, Jean-Claude
Affiliations: LORIA and IECN, Université Henri Poincaré, 54506 Vandoeuvre-lès-Nancy, France. E-mail: [email protected] | Laboratoire MIA, Equipe MAGE, FST, Université de Haute Alsace, 68093, Mulhouse, France. E-mail: [email protected]
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. We introduce a family of remarkable symmetrical polynomials which play a crucial role in the computation of the size of the araucarias. We prove that the minimal partial automaton which recognizes the shuffle of a finite number of special words contains an araucaria for each integer k>0.
Keywords: Automaton, shuffle of words, remarkable polynomials, trees
Journal: Fundamenta Informaticae, vol. 74, no. 4, pp. 579-601, 2006
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]