Hairpin completion with bounded stem-loop

DOI10.1007/978-3-642-31653-1_38MaRDI QIDQ3167515zbMATH OpenOpenAlexFDO

Authors Szilárd Zsolt Fazekas, Robert Mercaş, Kayoko Shikishima-Tsuji

Publication date 2 November 2012

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31653-1_38

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• The pseudopalindromic completion of regular languages
• Bounded hairpin completion
• Bounded Hairpin Completion
• Language theoretical properties of hairpin formations
• On the hairpin incompletion

Cited in

(4)

• Bounded Hairpin Completion
• The pseudopalindromic completion of regular languages
• Inner palindromic closure
• A series of algorithmic results related to the iterated hairpin completion

This page was built for publication: Hairpin completion with bounded stem-loop

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167515)