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 contextfree 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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Leupold, P. (2007). Duplication roots. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4588 LNCS, pp. 290–299). Springer Verlag. https://doi.org/10.1007/978-3-540-73208-2_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
