Abstract
The investigation of the “clustering effect” of the Burrows-Wheeler transform (BWT) leads to study the words having simple BWT, i.e. words w over an ordered alphabet A = {a 1,a 2,...,a k }, with a 1 < a 2 < ... < a k , such that bwt(w) is of the form \(a_k^{n_k} a_{k-1}^{n_{k-1}} \cdots a_1^{n_1}\), for some non-negative integers n 1, n 2, ..., n k . We remark that, in the case of binary alphabets, there is an equivalence between words having simple BWT, the family of (circular) balanced words and the conjugates of standard words. In the case of alphabets of size greater than two, there is no more equivalence between these notions. As a main result of this paper we prove that, under assumption of balancing, the following three conditions on a word w are equivalent: i) w has simple BWT, ii) w is a circularly rich word, and iii) w is a conjugate of a finite epistandard word.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Altman, E., Gaujal, B., Hordijk, A.: Balanced sequences and optimal routing. Journal of the ACM 47(4), 752–775 (2000)
Arnoux, P., Rauzy, G.: Représentation géométrique de suites de complexité 2n + 1. Bull. Soc. Math. France 119, 199–215 (1991)
Bucci, M., De Luca, A., Glen, A., Zamboni, L.Q.: A connection between palindromic and factor complexity using return words. Advance. Advances in Applied Mathematics 42, 60–74 (2009)
Bucci, M., De Luca, A., Glen, A., Zamboni, L.Q.: A new characteristic property of rich words. Theoretical Computer Science (in press) (2008) doi: 10.1016/j.tcs.2008.11.001
Burrows, M., Wheeler, D.J.: A block sorting data compression algorithm. Technical report, DIGITAL System Research Center (1994)
de Luca, A.: Sturmian words: structure, combinatorics, and their arithmetics. Theoretical Computer Science 183(1), 45–82 (1997)
Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoretical Computer Science 255(1-2), 539–553 (2001)
Aviezri, S.F.: Complementing and exactly covering sequences. J. Combinatorial Theory Ser. A 14(1), 8–20 (1973)
Glen, A., Justin, J.: Episturmian words: a survey. To appear in RAIRO Theoretical Informatics and Applications (2009)
Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic richness. European Journal of Combinatorics 30(2), 510–531 (2009)
Jenkinson, O., Zamboni, L.Q.: Characterisations of balanced words via orderings. Theoretical Computer Science 310(1-3), 247–271 (2004)
Justin, J.: Episturmian morphisms and a Galois theorem on continued fractions. Theoretical Informatics and Applications 39(1), 207–215 (2005)
Justin, J., Pirillo, G.: Episturmian words and episturmian morphisms. Theoretical Computer Science 276(1-2), 281–313 (2002)
Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics, vol. 17. Addison-Wesley, Reading (1983); Reprinted in the Cambridge Mathematical Library, Cambridge University Press (1997)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Mantaci, R., Mantaci, S., Restivo, A.: Balance properties and distribution of squares in circular words. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 504–515. Springer, Heidelberg (2008)
Mantaci, S., Restivo, A., Sciortino, M.: Burrows-Wheeler transform and Sturmian words. Information Processing Letters 86, 241–246 (2003)
Morse, M., Hedlund, G.A.: Symbolic dynamics II. Sturmian trajectories. American Journal of Mathematics 62(1), 1–42 (1940)
Paquin, G.: On a generalization of Christoffel words: epichristoffel words. In: Proceedings of Journées Montoises D’Informatique Théorique (2008)
Paquin, G., Vuillon, L.: A characterization of balanced episturmian sequences. Electronic Journal of Combinatorics 14, 12 (2006)
Rauzy, G.: Suites à termes dans un alphabet fini. In: Séminaire de théorie des Nombres de Bordeaux. Exposé, vol. 25, pp. 1–16 (1982/1983)
Restivo, A., Rosone, G.: Burrows-Wheeler transform and palindromic richness. Theoretical Computer Science (in press) (accepted manuscript) (2009) doi: 10.1016/j.tcs.2009.03.008
Simpson, J., Puglisi, S.J.: Words with simple Burrows-Wheeler transforms. Electronic Journal of Combinatorics 15, article R83 (2008)
Vuillon, L.: Balanced words. Bull. Belg. Math.Soc. 10(5), 787–805 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Restivo, A., Rosone, G. (2009). Balanced Words Having Simple Burrows-Wheeler Transform. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)