Infinite words with linear subword complexity
- 1 June 1989
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 65 (2) , 221-242
- https://doi.org/10.1016/0304-3975(89)90046-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Some combinatorial properties of the Thue–Morse sequence and a problem in semigroupsTheoretical Computer Science, 1989
- On the factors of the thue-morse word on three symbolsInformation Processing Letters, 1988
- A permutational property of groupsArchiv der Mathematik, 1985
- On the burnside problem for semigroupsJournal of Algebra, 1984
- An effective bound for groups of linear growthArchiv der Mathematik, 1984
- On the subword complexity of DOL languages with a constant distributionInformation Processing Letters, 1981
- 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
- An introduction to the theory of numbersBulletin of the American Mathematical Society, 1929