On the subword complexity of Thue–Morse polynomial extractions
- 10 December 2007
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 389 (1-2), 318-329
- https://doi.org/10.1016/j.tcs.2007.10.015
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Linear independence of automatic formal power seriesDiscrete Mathematics, 2006
- Squares and overlaps in the Thue-Morse sequence and some variantsRAIRO - Theoretical Informatics and Applications, 2006
- Subword complexity of a generalized Thue-Morse wordInformation Processing Letters, 1995
- Finite automata and morphisms in assisted musical composition*Journal of New Music Research, 1995
- Sous-suites polynomiales de certaines suites automatiquesJournal de Théorie des Nombres de Bordeaux, 1993
- Some combinatorial properties of the Thue–Morse sequence and a problem in semigroupsTheoretical Computer Science, 1989
- Subword complexities of various classes of deterministic developmental languages without interactionsTheoretical Computer Science, 1975
- Uniform tag sequencesTheory of Computing Systems, 1972
- Recurrent geodesics on a surface of negative curvatureTransactions of the American Mathematical Society, 1921
- Recurrent Geodesics on a Surface of Negative CurvatureTransactions of the American Mathematical Society, 1921