@inproceedings{upm41500,
doi = {10.1007/978-3-319-08846-4\_13},
year = {2014},
pages = {176--187},
title = {Bounded prefix-suffix duplication},
publisher = {Springer},
booktitle = {Implementation and application of automata : 19th International Conference, CIAA 2014 Giessen, Germany, July 30 - August 2, 2014 : Proceedings},
volume = {8587},
address = {Cham (Suiza)},
isbn = {978-3-319-08845-7},
author = {Gil Rubio, Francisco Javier and Mitrana, Victor and Dumitran, Marius and Manea, Florin},
url = {https://link.springer.com/chapter/10.1007/978-3-319-08846-4\%5f13},
abstract = {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.}
}