Lyndon words and Fibonacci numbers
Author:
- 26 September 2013
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 121, 34-44
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Weinbaum factorizations of primitive wordsRussian Mathematics, 2010
- Least Periods of Factors of Infinite WordsRAIRO - Theoretical Informatics and Applications, 2008
- On extremal properties of the Fibonacci wordRAIRO - Theoretical Informatics and Applications, 2008
- UNAVOIDABLE SETS OF CONSTANT LENGTHInternational Journal of Algebra and Computation, 2004
- Fine and Wilf's theorem for three periods and a generalization of Sturmian wordsTheoretical Computer Science, 1999
- Sturmian words, Lyndon words and treesTheoretical Computer Science, 1997
- Squares, cubes, and time-space efficient string searchingAlgorithmica, 1995
- Factorizing words over an ordered alphabetJournal of Algorithms, 1983
- A combinatorial property of the Fibonacci wordsInformation Processing Letters, 1981
- Free Differential Calculus, IV. The Quotient Groups of the Lower Central SeriesAnnals of Mathematics, 1958