Abstract
This paper is part of the investigation of some operations on words and languages with motivations coming from DNA biochemistry, namely three variants of hairpin completion and three variants of hairpin reduction. Since not all the hairpin completions or reductions of semilinear languages remain semilinear, we study sufficient conditions for semilinear languages to preserve their semilinearity property after applying the non-iterated hairpin completion or hairpin reduction. A similar approach is then applied to the iterated variants of these operations. Along these lines, we define the hairpin reduction root of a language and show that the hairpin reduction root of a semilinear language is not necessarily semilinear except the universal language. A few open problems are finally discussed.
Similar content being viewed by others
References
Blattner M, Latteux M (1981) Parikh-bounded languages. In: Proceedings of the 8th international colloquium on automata, languages and programming (ICALP). LNCS, vol 115, pp 316–323
Bordihn H, Mitrana V, Păun A, Păun M (2019) Further properties of self-assembly by hairpin formation. In: Proceedings of the 18th international conference on unconventional computation and natural computation (UCNC). LNCS, vol 11493, pp 37–51
Bottoni P, Labella A, Manca V, Mitrana V (2006) Superposition based on Watson–Crick-like complementarity. Theory Comput Syst 39:503–524
Castellanos J, Mitrana V (2001) Some remarks on hairpin and loop languages. In: Words, semigroups, and transductions - festschrift in honor of gabriel thierrin. World Scientific, Singapore, pp 47–58
Chen H-L, Doty D, Soloveichik D (2014) Deterministic function computation with chemical reaction networks. Nat Comput 13:517–534
Cheptea D, Martin-Vide C, Mitrana V (2006) A new operation on words suggested by DNA biochemistry: hairpin completion. In: Proceedings of transgressive computing, pp 216–228
Csuhaj-Varjú E, Petre I, Vaszil G (2007) Self-assembly of strings and languages. Theoret Comput Sci 374:74–81
Deaton R, Murphy R, Garzon M, Franceschetti DR, Stevens SE (1998) Good encodings for DNA-based solutions to combinatorial problems. In: Proceedings of DNA-based computers II. DIMACS series, vol 44, pp 247–258
Enaganti SK, Ibarra OH, Kari L, Kopecki S (2007) On the overlap assembly of strings and languages. Nat Comput 16:175–185
Garzon M, Deaton R, Neathery P, Murphy RC, Franceschetti DR, Stevens E (1997) On the encoding problem for DNA computing. In: Proceedings of the third DIMACS workshop on DNA-based computing, pp 230–237
Garzon M, Deaton Nino LF, Stevens SE Jr, Wittner M (1998) Genome encoding for DNA computing. In: Proceedings of the third genetic programming conference, pp 684–690
Ginsburg S (1971) AFL with the semilinear property. J Comput Syst Sci 5:365–396
Ginsburg S, Spanier EH, Henry E (1966) Semigroups, Presburger formulas, and languages. Pac J Math 16:285–296
Goldstine J (1977) A simplified proof of Parikh’s theorem. Discrete Math 19:235–239
Ito M, Leupold P, Manea F, Mitrana V (2011) Bounded hairpin completion. Inf Comput 209:471–485
Kari L, Konstantinidis S, Sosik P, Thierrin G (2005) On hairpin-free words and languages. In: Proceedings of the developments in language theory. LNCS, vol 3572, pp 296–307
Kopczyński E, To AW (2010) Parikh images of grammars: complexity and applications. In: Proceedings of the 25th annual IEEE symposium on logic in computer science (LICS), pp 80–89
Kopecki S (2011) On the iterated hairpin completion. Theor Comput Sci 412:3629–3638
Manea F, Martín-Vide C, Mitrana V (2009a) On some algorithmic problems regarding the hairpin completion. Discrete Appl Math 157:2143–2152
Manea F, Mitrana V, Yokomori T (2009b) Two complementary operations inspired by the DNA hairpin formation: completion and reduction. Theor Comput Sci 410:417–425
Manea F, Mitrana V, Sempere J (2009c) Some remarks on superposition based on Watson–Crick-Like complementarity. In: Proceedings of the developments in language theory. LNCS, vol 5583, pp 372–383
Manea F (2010) A series of algorithmic results related to the iterated hairpin completion. Theor Comput Sci 411:4162–4178
Manea F, Mercas R, Mitrana V (2012) Hairpin lengthening and shortening of regular languages. In: Languages alive. LNCS, vol 7300, pp 145–159
Manea F, Martín-Vide C, Mitrana V (2015) Hairpin lengthening: language theoretic and algorithmic results. J Logic Comput 25:987–1009
Oppen D (1978) A \(2^{2^{2^{pn}}}\) upper bound on the complexity of presburger arithmetic. J Comput Syst Sci 16:323–332
Parikh R (1966) On context-free languages. J ACM 13:570–581
Păun G, Rozenberg G, Yokomori T (2001) Hairpin languages. Int J Found Comput Sci 12:837–847
Rosales JC, García-Sánchez PA (2009) Numerical semigroups. Springer, New York
Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages, vol 3. Springer, Berlin
Sakamoto K, Gouzu H, Komiya K, Kiga D, Yokoyama S, Yokomori T, Hagiya M (2000) Molecular computation by DNA hairpin formation. Science 288:1223–1226
Shikishima-Tsuji K (2016) Regularity of iterative hairpin completions of crossing \((2,2)\)-words. Int J Found Comput Sci 27:375–390
Winfree E, Yang X, Seeman NC (1999) Universal computation via self-assembly of DNA: some theory and experiments. DNA based computers II. DIMACS 44:191–213
Funding
This work was supported by a grant of the Romanian National Authority for Scientific Research and Innovation, Project Number POC P-37-257. Victor Mitrana has also been supported by the Alexander von Humboldt Foundation.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Bordihn, H., Mitrana, V., Păun, A. et al. Hairpin completions and reductions: semilinearity properties. Nat Comput 20, 193–203 (2021). https://doi.org/10.1007/s11047-020-09797-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-020-09797-0