Abstract
In this paper we investigate the periodic structure of rich words (i.e., words having the highest possible number of palindromic factors), giving new results relating them with periodic-like words. In particular, some new characterizations of rich words and rich palindromes are given. We also prove that a periodic-like word is rich if and only if the square of its fractional root is also rich.
The work for this paper was partially supported by the Italian Ministry of Education (MIUR) under the project PRIN 2007 “Proprietà combinatorie e strutturali nella teoria dei linguaggi formali”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoretical Computer Science 255, 539–553 (2001)
Allouche, J.P., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theoretical Computer Science 292, 9–31 (2003)
Ambrož, P., Frougny, C., Masáková, Z., Pelantová, E.: Palindromic complexity of infinite words associated with simple Parry numbers. Ann. Inst. Fourier (Grenoble) 56, 2131–2160 (2006)
Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic richness. European Journal of Combinatorics 30, 510–531 (2009)
Bucci, M., De Luca, A., Glen, A., Zamboni, L.Q.: A connection between palindromic and factor complexity using return words. Advances in Applied Mathematics 42, 60–74 (2009)
de Luca, A., Glen, A., Zamboni, L.Q.: Rich, Sturmian, and trapezoidal words. Theoretical Computer Science 407, 569–573 (2008)
Bucci, M., De Luca, A., Glen, A., Zamboni, L.Q.: A new characteristic property of rich words. In: Theoretical Computer Science (2009) doi:10.1016/j.tcs.2008.11.001
Carpi, A., de Luca, A.: Periodic-like words, periodicity, and boxes. Acta Informatica 37, 597–618 (2001)
Carpi, A., de Luca, A.: Semiperiodic words and root-conjugacy. Theoretical Computer Science 292, 111–130 (2003)
Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983); Reprinted by Cambridge University Press, Cambridge UK (1997)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
de Luca, A.: On the combinatorics of finite words. Theoretical Computer Science 218, 13–39 (1999)
D’Alessandro, F.: A combinatorial problem on trapezoidal words. Theoretical Computer Science 273, 11–33 (2002)
de Luca, A., De Luca, A.: Combinatorial properties of Sturmian palindromes. International Journal of Foundations of Computer Science 17, 557–574 (2006)
Berstel, J.: Sturmian and Episturmian Words (a survey of some recent results). In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 23–47. Springer, Heidelberg (2007)
de Luca, A., De Luca, A.: Pseudopalindrome closure operators in free monoids. Theoretical Computer Science 362, 282–300 (2006)
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
Bucci, M., de Luca, A., De Luca, A. (2009). Rich and Periodic-Like Words. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_11
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)