Abstract
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After stating a few elementary properties of this type of root, we explore the question whether or not a language has finite duplication root. For regular languages and uniformly bounded duplication root this is decidable.
The main result then concerns the closure of regular and context-free languages under duplication. Regular languages are closed under bounded and uniformly bounded duplication root, while neither regular nor context-free language are closed under general duplication root.
This is a preview of subscription content, log in via an institution to check access.
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
Book, R., Otto, F.: String-Rewriting Systems. Springer, Berlin Heidelberg (1988)
Bovet, D.P., Varricchio, S.: On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems. Information Processing Letters 44, 119–123 (1992)
Crochemore, M.: Sharp Caracterizations of Squarefree Morphisms. Theoretical Computer Science 18, 221–226 (1982)
Currie, J.D.: There are Ternary Circular Square-free Words of Length n for n ≥ 18. Electric Journal of Combinatorics 9(1), N10 (2002)
Ito, M., Leupold, P., Shikishima-Tsuji, K.: Closure of Language Classes under Bounded Duplication. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 238–247. Springer, Heidelberg (2006)
Dassow, J., Mitrana, V., Păun, G.: On the Regularity of Duplication Closure. Bull. EATCS 69, 133–136 (1999)
Ehrenfeucht, A., Rozenberg, G.: On the Separating Power of EOL Systems. RAIRO Informatique Théorique 17(1), 13–22 (1983)
Ehrenfeucht, A., Rozenberg, G.: On Regularity of Languages Generated by Copying Systems. Discrete Applied Mathematics 8, 313–317 (1984)
Hofbauer, D., Waldmann, J.: Deleting String-Rewriting Systems preserve regularity. Theoretical Computer Science 327, 301–317 (2004)
Leupold, P.: Duplication Roots – Extended Abstract. In: Proceedings Theorietag Automaten und Formale Sprachen, TU Wien, Wien, pp. 91–93 ( 2006)
Leupold, P., Martín, C., Mitrana, V.: Uniformly Bounded Duplication Languages. Discrete Applied Mathematics 146(3), 301–310 (2005)
Leupold, P., Mitrana, V., Sempere, J.: Formal Languages Arising from Gene Repeated Duplication. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 297–308. Springer, Heidelberg (2003)
Ross, R., Winklmann, K.: Repetitive Strings are not Context-Free. RAIRO Informatique Théorique 16(3), 191–199 (1982)
Wang, M.-W.: On the Irregularity of the Duplication Closure. Bull. EATCS 70, 162–163 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leupold, P. (2007). Duplication Roots. In: Harju, T., Karhumäki, J., Lepistö, A. (eds) Developments in Language Theory. DLT 2007. Lecture Notes in Computer Science, vol 4588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73208-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-73208-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73207-5
Online ISBN: 978-3-540-73208-2
eBook Packages: Computer ScienceComputer Science (R0)