Hairpin completions and reductions: semilinearity properties

DOI10.1007/S11047-020-09797-0MaRDI QIDQ6095486zbMATH OpenOpenAlexFDO

Authors Henning Bordihn, Victor Mitrana, Andrei Păun, Mihaela Păun

Publication date 8 September 2023

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-020-09797-0

zbMATH Keywords

DNA hairpin formationhairpin completionshairpin reductionssemilinear languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Recommendations

• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
• Hairpin Completion Versus Hairpin Reduction
• Further properties of self-assembly by hairpin formation
• Bounded Hairpin Completion
• Bounded hairpin completion

Cites work

• A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
• A series of algorithmic results related to the iterated hairpin completion
• A simplified proof of Parikh's theorem
• AFL with the semilinear property
• Bounded hairpin completion
• Deterministic function computation with chemical reaction networks
• Developments in Language Theory
• Further properties of self-assembly by hairpin formation
• Hairpin languages
• Hairpin Lengthening and Shortening of Regular Languages
• Hairpin lengthening: language theoretic and algorithmic results
• scientific article; zbMATH DE number 5722790 (Why is no real title available?)
• scientific article; zbMATH DE number 3723892 (Why is no real title available?)
• scientific article; zbMATH DE number 1241374 (Why is no real title available?)
• scientific article; zbMATH DE number 1241377 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Numerical semigroups.
• On Context-Free Languages
• On iterated hairpin completion
• On some algorithmic problems regarding the hairpin completion
• On the overlap assembly of strings and languages
• Regularity of iterative hairpin completions of crossing (2, 2)-words
• Self-assembly of strings and languages
• Semigroups, Presburger formulas, and languages
• SOME REMARKS ON HAIRPIN AND LOOP LANGUAGES
• Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
• Superposition based on Watson-Crick-like complementarity
• Two complementary operations inspired by the DNA hairpin formation: Completion and reduction

Cited in

(4)

• On some algorithmic problems regarding the hairpin completion
• Most pseudo-copy languages are not context-free
• Bounded Hairpin Completion
• A series of algorithmic results related to the iterated hairpin completion

This page was built for publication: Hairpin completions and reductions: semilinearity properties

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