Hairpin completions and reductions: semilinearity properties
From MaRDI portal
Publication:6095486
DOI10.1007/s11047-020-09797-0zbMath1530.68139OpenAlexW3037439308MaRDI QIDQ6095486
Mihaela Păun, Henning Bordihn, Andrei Păun, Victor Mitrana
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic function computation with chemical reaction networks
- On iterated hairpin completion
- Bounded hairpin completion
- A series of algorithmic results related to the iterated hairpin completion
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
- Self-assembly of strings and languages
- On some algorithmic problems regarding the hairpin completion
- Numerical semigroups.
- A simplified proof of Parikh's theorem
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- On the overlap assembly of strings and languages
- Further properties of self-assembly by hairpin formation
- Superposition based on Watson-Crick-like complementarity
- Semigroups, Presburger formulas, and languages
- AFL with the semilinear property
- Hairpin Lengthening and Shortening of Regular Languages
- Hairpin lengthening: language theoretic and algorithmic results
- Some Remarks on Superposition Based on Watson-Crick-Like Complementarity
- SOME REMARKS ON HAIRPIN AND LOOP LANGUAGES
- HAIRPIN LANGUAGES
- Developments in Language Theory
- On Context-Free Languages
- Regularity of Iterative Hairpin Completions of Crossing (2, 2)-Words
This page was built for publication: Hairpin completions and reductions: semilinearity properties
