Abstract
We present general results that are useful in showing closure and decidable properties of large classes of languages with respect to biologically-inspired operations. We use these results to prove new decidability results and closure properties of some classes of languages under bio-operations such hairpin-inversion, the recently studied operation of pseudo-inversion, and other bio-operations. We also provide techniques for proving undecidability results. In particular, we give a new approach for proving the undecidability of problems for which the usual method of reduction to the undecidability of the Post Correspondence Problem seems hard to apply. Our closure and decidability results strengthen or generalize previous results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Cho D-J, Han Y-S, Kang S-D, Kim H, Ko S-K, Salomaa K (2014) Pseudo-inversion on formal languages. In: Proceedings of the unconventional computation and natural computation 2014, pp 93–104
Daley M, Ibarra OH, Kari L (2003) Closure and decidability properties of some languages classes with respect to ciliate bio-operations. Theor Comput Sci 306(1–3):19–38
Daley M, Kari L, McQuillan I (2004) Families of languages defined by ciliate bio-operations. Theor Comput Sci 320(1):51–69
Deaton R, Garzon M, Murphy RC, Rose JA, Franceschetti DR, Stevens SE Jr (1996) Genetic search of reliable encodings for DNA-based computation. In: Proceedings of the 1st conference on genetic programming, pp 9–15
Garzon M, Deaton R, Nino LF, Stevens E, Wittner M (1998) Encoding genomes for DNA computing. In: Proceedings of the of 3rd annual conference on genetic programming 1998, pp 684–690
Ginsburg S (1966) The mathematical theory of context-free languages. McGraw-Hill, New York
Gurari E, Ibarra OH (1981) The complexity of decision problems for finite-turn multicounter machines. J Comput Syst Sci 22:220–229
Hague M, Lin AW (2011) Model checking recursive programs with numeric data types. In: CAV 2011, pp 743–759
Hopcroft JE, Ullman JD (1978) Introduction to automata, languages and computation. Addison-Wesley, Reading
Hussini S, Kari L, Konstantinidis S (2002) Coding properties of DNA languages. In: Proceeding of the 8th international meeting on DNA computing, pp 57–69
Ibarra OH (1978) Reversal-bounded multicounter machines and their decision problems. J ACM 25(1):116–133
Ibarra OH, Jiang T, Tran NQ, Wang H (1995) New decidability results concerning two-way counter machines. SIAM J Comput 24(1):123–137
Jonoska N, Mahalingam K, Chen J (2005) Involution codes: with application to DNA coded languages. Nat Comput 4(2):141–162
Jonoska N, Kari L, Mahalingam K (2008) Involution solid and join codes. Fundamenta Informaticae 86(1,2):127–142
Kari L, Mahalingham K (2006) DNA codes and their properties. In: Proceedings of the 12th international meeting on DNA computing, pp 127–142
Kari L, Lossevsa E, Konstantinidis S, Sosik P, Thierrin G (2006) A formal language analysis of DNA hairpin structures. Fundamenta Informaticae 71(4):453–475
Minsky M (1961) Recursive unsolvability of Post’s problem of Tag and other topics in the theory of Turing machines. Ann Math 74:437–455
Acknowledgments
Supported in part by NSF Grants CCF-1143892 and CCF-1117708.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ibarra, O.H. On decidability and closure properties of language classes with respect to bio-operations. Nat Comput 15, 225–234 (2016). https://doi.org/10.1007/s11047-015-9500-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-015-9500-y