On the number of factors of Sturmian words
- 22 May 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 82 (1) , 71-84
- https://doi.org/10.1016/0304-3975(91)90172-x
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Infinite words with linear subword complexityTheoretical Computer Science, 1989
- Sequences with minimal block growthTheory of Computing Systems, 1973
- Uniform tag sequencesTheory of Computing Systems, 1972
- Symbolic Dynamics II. Sturmian TrajectoriesAmerican Journal of Mathematics, 1940