On the combinatorics of finite words
- 1 April 1999
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 218 (1) , 13-39
- https://doi.org/10.1016/s0304-3975(98)00248-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Sturmian words: structure, combinatorics, and their arithmeticsTheoretical Computer Science, 1997
- Sturmian words, Lyndon words and treesTheoretical Computer Science, 1997
- Some combinatorial properties of Sturmian wordsTheoretical Computer Science, 1994
- On bispecial factors of the Thue–Morse wordInformation Processing Letters, 1994
- On the maximum number of distinct factors of a binary stringGraphs and Combinatorics, 1993
- 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
- Sequences with minimal block growthTheory of Computing Systems, 1973