Compressed string-matching in standard Sturmian words

Theoretical Computer Science

Volumn 410, Issue 30-32, 2009, Pages 2804-2810

  Baturo, Paweł ^a   Rytter, Wojciech ^a,b  

^a NICOLAUS COPERNICUS UNIVERSITY   (Poland)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Lexicographic numeration property; Linear time; String matching; Sturmian words

Indexed keywords

ARITHMETIC PROGRESSIONS; FAST COMPUTATION; INPUT STRING; LEXICOGRAPHIC NUMERATION PROPERTY; LINEAR TIME; SIMPLE ALGORITHM; STRING-MATCHING; STURMIAN WORD; STURMIAN WORDS;

NUMBER THEORY; STANDARDS;

SET THEORY;

EID: 67649651660     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.03.007     Document Type: Article

References (15)

1. Allouche J.-P., and Shallit J. Automatic Sequences: Theory, Applications, Generalizations (2003), Cambridge University Press, UK
2. P. Baturo, M. Piatkowski, W. Rytter, The number of runs in Sturmian words, CIAA, 2008, pp. 252-261
3. P. Baturo, M. Piatkowski, W. Rytter, Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words, presented at Praque Stringology Conference 2008
4. Berstel J., and Karhumäki J. Combinatorics on words - a tutorial. Bull. EATCS 79 (2003) 178-228
5. Berstel J., and Séébold P. Sturmian words. M. Lothaire, Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications vol. 90 (2002), Cambridge University Press, Cambridge 45-110 (chapter 2)
6. Crochemore M., and Rytter W. Jewels of Stringology (2003), World Scientific
7. Martin Farach, Mikkel Thorup, String matching in Lempel-Ziv compressed strings, STOC 1995, pp. 703-712
8. Ferragina P., and Manzini G. Indexing compressed text. J. ACM 52 (2005) 552-581
9. Jenkinson O., and Zamboni L. Characterizations of balanced words via orderings. Theoret. Comput. Sci. 310 1-3 (2004) 247-271
10. de Luca A. Sturmian words: Structure, combinatorics and their arithmetics. Theoret. Comput. Sci. 183 1 (1997) 45-82
11. Mantaci S., Restivo A., and Sciortino M. Burrows-Wheeler transform and Sturmian words. IPL 86 (2003) 241-246
12. Pirillo G. Inequalities characterizing standard Sturmian and episturmian words. Theoret. Comput. Sci. 341 1 (2005) 276-292
13. Pirillo G. A new characteristic property of the palindrome prefixes of a standard Sturmian word. Sem. Lothar. Combin. 43 (1999) pp. 3
14. W. Rytter, Grammar compression, LZ-Encodings, and String Algorithms with Implicit Input., ICALP 2004, pp. 15-27
15. Sciortino M., and Zamboni L. Suffix automata and standard Sturmian words. Developments in Language Theory (2007) 382-398