Some combinatorial properties of Sturmian words
- 26 December 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 136 (2) , 361-385
- https://doi.org/10.1016/0304-3975(94)00035-h
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDSInternational Journal of Algebra and Computation, 1993
- On the number of factors of Sturmian wordsTheoretical Computer Science, 1991
- Sur les facteurs des suites de sturmTheoretical Computer Science, 1990
- Infinite words with linear subword complexityTheoretical Computer Science, 1989
- A combinatorial property of the Fibonacci wordsInformation Processing Letters, 1981
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965
- Sturmian Minimal SetsAmerican Journal of Mathematics, 1944