On the iterated hairpin completion

DOI10.1007/978-3-642-14455-4_42MaRDI QIDQ3584915zbMATH OpenOpenAlexFDO

Authors Steffen Kopecki

Publication date 31 August 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-14455-4_42

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On iterated hairpin completion
• Some remarks on the hairpin completion
• Iterated hairpin completions of non-crossing words
• On the regularity of iterated hairpin completion of a single word
• Regularity of iterative hairpin completions of crossing (2, 2)-words

Cited in

(14)

• On some algorithmic problems regarding the hairpin completion
• Iterated hairpin completions of non-crossing words
• Some remarks on the hairpin completion
• On the regularity of iterated hairpin completion of a single word
• It is NL-complete to decide whether a hairpin completion of regular languages is regular
• On the Hairpin Completion of Regular Languages
• Bounded Hairpin Completion
• Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
• Language theoretical properties of hairpin formations
• On iterated hairpin completion
• Bounded hairpin completion
• Regularity of iterative hairpin completions of crossing (2, 2)-words
• A series of algorithmic results related to the iterated hairpin completion
• Deciding regularity of hairpin completions of regular languages in polynomial time

This page was built for publication: On the iterated hairpin completion

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