Burrows-Wheeler transform and Sturmian words

Information Processing Letters

Volumn 86, Issue 5, 2003, Pages 241-246

  Mantaci, S ^a   Restivo, A ^a   Sciortino, M ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

Burrows Wheeler transform; Combinatorial problems; Formal languages; Sturmian words

Indexed keywords

COMBINATORIAL MATHEMATICS; FORMAL LANGUAGES; MATHEMATICAL TRANSFORMATIONS;

STURMIAN WORDS;

DATA PROCESSING;

EID: 0038559790     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00512-4     Document Type: Article

References (8)

1. M. Burrows, D.J. Wheeler, A block sorting data compression algorithm, Technical Report, DIGITAL System Research Center, 1994.
2. de Luca A. Combinatorics of Standard Sturmian words. Milcielski J., Rozenberg G., Salomaa A. Structures in Logic and Computer Science. Lecture Notes in Comput. Sci. 1261:1997;249-267 Springer, Berlin.
3. de Luca A., Mignosi F. Some combinatorial properties of Sturmian words. Theoret. Comput. Sci. 136:1994;361-385.
4. J. Désarménien, D. Perrin, Personal communication.
5. Knuth D., Morris J.H., Pratt V.R. Fast pattern matching in strings. SIAM J. Comput. 6:(2):1977;323-350.
6. Lothaire M. Algebraic Combinatorics on Words. Encyclopedia Math. Appl. 90:2002;Cambridge University Press, Cambridge, UK.
7. Manzini G. An analysis of the Burrows-Wheeler transform. J. ACM. 48:(3):2001;407-430.
8. Morse M., Hedlund G.A. Symbolic dynamics. II: Sturmian trajectories. Amer. J. Math. 62:1940;1-42.