We consider a restricted variant of the prefix-suffix duplication operation, called bounded prefix-suffix duplication. It consists in the iterative duplication of a prefix or suffix, whose length is bounded by a constant, of a given word. We give a sufficient condition for the closure under bounded prefix-suffix duplication of a class of languages. Consequently, the class of regular languages is closed under bounded prefix-suffix duplication; furthermore, we propose an algorithm deciding whether a regular language is a finite k-prefix-suffix duplication language. An efficient algorithm solving the membership problem for the k-prefix-suffix duplication of a language is also presented. Finally, we define the k-prefix-suffix duplication distance between two words, extend it to languages and show how it can be computed for regular languages. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Dumitran, M., Gil, J., Manea, F., & Mitrana, V. (2014). Bounded prefix-suffix duplication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8587 LNCS, pp. 176–187). Springer Verlag. https://doi.org/10.1007/978-3-319-08846-4_13
Mendeley helps you to discover research relevant for your work.