Palindromic prefixes and episturmian words
Author:
- Stéphane FischlerSFStéphane Fischler
- 1 October 2006
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 113 (7) , 1281-1304
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Palindromic Prefixes and Diophantine ApproximationMonatshefte für Mathematik, 2006
- Exponents of Diophantine Approximation and Sturmian Continued FractionsAnnales de l'institut Fourier, 2005
- Spectres pour l'approximation d'un nombre réel et de son carréComptes Rendus Mathematique, 2004
- Palindrome complexityTheoretical Computer Science, 2003
- A Palindromic Half-Line Criterion for Absence of Eigenvalues and Applications to Substitution HamiltoniansAnnales Henri Poincare, 2001
- Episturmian words and some constructions of de Luca and RauzyTheoretical Computer Science, 2001
- Limit values of the recurrence quotient of Sturmian sequencesTheoretical Computer Science, 1999
- Sturmian words: structure, combinatorics, and their arithmeticsTheoretical Computer Science, 1997
- Some combinatorial properties of Sturmian wordsTheoretical Computer Science, 1994
- Approximation to real numbers by algebraic integersActa Arithmetica, 1968