Affiliations: Laboratoire LMIA, Equipe MAGE, Université de Haute Alsace, 4, rue des Frères Lumière, 68093 Mulhouse, France. [email protected] | Laboratoire LMIA, Equipe MAGE, Université de Haute Alsace, 4, rue des Frères Lumière, 68093 Mulhouse, France. [email protected]
Note: [] Address for correspondence: Laboratoire LMIA, Equipe MAGE, Université de Haute Alsace, 4, rue des Frères Lumière, 68093 Mulhouse, France
Abstract: Araucarias have been introduced by Schott and Spehner as trees which appear in the minimal automaton of the shuffle of words. We give here a new definition of araucarias which is more constructive and we prove that our definition of araucarias is equivalent to the original one. From the new definition we derive an optimal algorithm for the construction of araucarias and a new method for calculating their size. Moreover we characterize araucarias by properties of their maximal paths, by associating a capacity to every edge. We then show that every araucaria can be obtained by grafting and merging smaller araucarias. We prove also that every directed tree can be embedded in an araucaria. Moreover we define a capacity for every vertex of an araucaria, which leads to different new enumeration formulas for araucarias.
Keywords: Algorithms, trees, symmetric polynomials, combinatorics, shuffle of words
