On Repetitiveness Measures of Thue-Morse Words
- 17 September 2020
- book chapter
- Published by Springer Nature
- p. 213-220
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed TextLecture Notes in Computer Science, 2013
- Sublinear Algorithms for Approximating String CompressibilityAlgorithmica, 2012
- Crochemore Factorization of Sturmian and Other Infinite WordsLecture Notes in Computer Science, 2006
- The Smallest Grammar ProblemIEEE Transactions on Information Theory, 2005
- Burrows–Wheeler transform and Sturmian wordsInformation Processing Letters, 2003
- Enumeration of factors in the Thue-Morse wordDiscrete Applied Mathematics, 1989
- Data compression via textual substitutionJournal of the ACM, 1982
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976
- Free Differential Calculus, IV. The Quotient Groups of the Lower Central SeriesAnnals of Mathematics, 1958
- Recurrent geodesics on a surface of negative curvatureTransactions of the American Mathematical Society, 1921