Hairpin lengthening: language theoretic and algorithmic results

DOI10.1093/LOGCOM/EXS076zbMATH Open1333.68110OpenAlexW2014204359MaRDI QIDQ3465044FDOQ3465044

Authors: Florin Manea, Carlos Martín-Vide, Victor Mitrana 

Publication date: 28 January 2016

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exs076

Recommendations

• Hairpin Lengthening
• Hairpin Lengthening and Shortening of Regular Languages
• Language theoretical properties of hairpin formations
• Bounded hairpin completion
• On the hairpin incompletion

zbMATH Keywords

DNA computingformal languageshairpin completionhairpin lengtheninghairpin structure

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (6)

• Hairpin Finite Automata
• Language theoretical properties of hairpin formations
• Hairpin Completion Versus Hairpin Reduction
• Hairpin completions and reductions: semilinearity properties
• Hairpin Lengthening and Shortening of Regular Languages
• Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)

This page was built for publication: Hairpin lengthening: language theoretic and algorithmic results

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