Hairpin Completion with Bounded Stem-Loop
Pseudopalindromes are words that are fixed points for some antimorphic involution. In this paper we discuss a newer word operation, that of pseudopalindromic completion, in which symbols are added to either side of the word such that the new obtained words are pseudopalindromes. This notion represents a particular type of hairpin completion, where the length of the hairpin is at most one. We give precise descriptions of regular languages that are closed under this operation and show that the regularity of the closure under the operation is decidable.
KeywordsRegular Language Primitive Root Short Word Membership Problem Pigeon Hole Principle
Unable to display preview. Download preview PDF.
- 1.Cheptea, D., Martín-Vide, C., Mitrana, V.: A new operation on words suggested by DNA biochemistry: Hairpin completion. Trans. Comput., 216–228 (2006)Google Scholar
- 11.Lothaire, M.: Combinatorics on Words. Cambridge University Press (1962/1997)Google Scholar
- 12.Mahalingam, K., Subramanian, K.G.: Palindromic completion of a word. In: BIC-TA, pp. 1459–1465. IEEE (2010)Google Scholar
- 17.Paun, G., Rozenberg, G., Yokomori, T.: Hairpin languages. Int. J. Found. Comput. Sci., 837–847 (2001)Google Scholar