Lyndon words, permutations and trees

Theoretical Computer Science

Volumn 307, Issue 1 SPEC., 2003, Pages 173-178

  Hohlweg, Christophe ^a,b   Reutenauer, Christophe ^a,b  

^a UNIVERSITÉ LOUIS PASTEUR   (France)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; INVERSE PROBLEMS; MAPS; TREES (MATHEMATICS);

PERMUTATIONS;

COMPUTER SCIENCE;

EID: 0042235627     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00099-9     Document Type: Conference Paper

References (18)

1. Chen K.-T., Fox R., Lyndon R. Free differential calculus IV. The quotient group of the lower central series. Ann. Math. 68:1958;81-95.
2. M. Crochemore, T. Hancart, T. Lecroq, Algorithmique du texte, Vuibert, 2001.
3. Donaghey R. Alternating permutations and binary increasing trees. J. Combin. Theory A. 18:1975;141-148.
4. Duval J.-P. Factorizing words over an ordered alphabet. J. Algorithms. 4:1983;363-381.
5. D. Foata, M.-P. Schützenberger, Nombres d'Euler et permutations alternantes, University of Florida, Gainesville, Department of Mathematics, 1971, preprint.
6. Françon J. Arbres binaires de recherche. propriétés combinatoires et applications RAIRO Inform. Théor. 10:1976;37-50.
7. Gessel I., Reutenauer C. Counting permutations with given cycle structure and descent set. J. Combin. Theory A. 64:1993;189-215.
8. Kundu S. Sorting tree, nestling tree and inverse permutation. Inform. Process. Lett. 6:1977;94-96.
9. M. Lothaire, Combinatorics on Words, 2nd Ed., Addison-Wesley, Reading, MA, 1983; Cambridge University Press, Cambridge, 1997.
10. McCreight E. A space-economical suffix tree construction algorithm. J. Assoc. Comput. Mach. 23:1976;262-272.
11. Melançon G. Combinatorics of Hall trees and Hall words. J. Combin. Theory A. 59:1992;285-308.
12. Melançon G., Reutenauer C. Lyndon words, free algebras and shuffles. Canad. J. Math. 41:1989;577-591.
13. Schensted C. Longest increasing and decreasing subsequences. Canad. J. Math. 13:1961;179-191.
14. M.-P. Schützenberger, Sur une propriété combinatoire des algèbres de lie libres pouvant être utilisée dans un problème de mathématiques appliquées, Séminaire P. Dubreil, Paris, Faculté des Sciences, 1958.
15. Sedgewick R., Flajolet P. An Introduction to the Analysis of Algorithms. 1996;Addison-Wesley, Reading, MA.
16. R. Stanley, Enumerative Combinatorics, Vol. A, Wadsworth and Brooks/Cole, 1986.
17. G. Viennot, Quelques algorithmes de permutation, in: Journées algorithmiques, Paris, Society for Mathematics of France, Astérisque, 1976, pp. 38-39, pp. 275-293.
18. J. Vuillemin, A unifying look at data structures, Comm. ACM 23, 1980, pp. 229-239.