String Attractors and Infinite Words
- 29 October 2022
- book chapter
- Published by Springer Nature
- p. 426-442
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- On extremal cases of Hopcroft’s algorithmTheoretical Computer Science, 2010
- Circular sturmian words and Hopcroft’s algorithmTheoretical Computer Science, 2009
- The Lempel–Ziv Complexity of Fixed Points of MorphismsSIAM Journal on Discrete Mathematics, 2007
- Suffix Automata and Standard Sturmian WordsLecture Notes in Computer Science, 2006
- Substitution dynamical systems: Characterization of linear repetitivity and applicationsJournal of Mathematical Analysis and Applications, 2006
- Languages under substitutions and balanced wordsJournal de Théorie des Nombres de Bordeaux, 2004
- Burrows–Wheeler transform and Sturmian wordsInformation Processing Letters, 2003
- Toeplitz Words, Generalized Periodicity and Periodically Iterated MorphismsEuropean Journal of Combinatorics, 1997
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976