Hairpin completion with bounded stem-loop

Authors:
Szilárd Zsolt Fazekas;Robert Mercaş;Kayoko Shikishima-Tsuji
Affiliations:
Department of Mathematics, Kyoto Sangyo University, Kita-Ku, Kyoto, Japan;Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany;Tenri University, Tenri, Japan
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 12
Cited 0

Results concerning palindromicity

Journal of Information Processing and Cybernetics
Sturmian words: structure, combinatorics, and their arithmetics

Theoretical Computer Science - Special issue: formal language theory
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String

Journal of the ACM (JACM)
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Pseudopalindrome closure operators in free monoids

Theoretical Computer Science
Hairpin Completion Versus Hairpin Reduction

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On some algorithmic problems regarding the hairpin completion

Discrete Applied Mathematics
On the Hairpin Completion of Regular Languages

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Watson---Crick palindromes in DNA computing

Natural Computing: an international journal
Bounded hairpin completion

Information and Computation
On iterated hairpin completion

Theoretical Computer Science
Iterated hairpin completions of non-crossing words

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.