{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T10:47:59Z","timestamp":1756810079405,"version":"3.41.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T00:00:00Z","timestamp":1430784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s11047-015-9500-y","type":"journal-article","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T11:20:02Z","timestamp":1430738402000},"page":"225-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On decidability and closure properties of language classes with respect to bio-operations"],"prefix":"10.1007","volume":"15","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,5]]},"reference":[{"key":"9500_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013104","DOI":"10.1007\/978-3-319-08123-6_8"},{"issue":"1\u20133","key":"9500_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0304-3975(03)00139-7","volume":"306","author":"M Daley","year":"2003","unstructured":"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\u20133):19\u201338","journal-title":"Theor Comput Sci"},{"issue":"1","key":"9500_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.tcs.2004.03.043","volume":"320","author":"M Daley","year":"2004","unstructured":"Daley M, Kari L, McQuillan I (2004) Families of languages defined by ciliate bio-operations. Theor Comput Sci 320(1):51\u201369","journal-title":"Theor Comput Sci"},{"key":"9500_CR4","unstructured":"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\u201315"},{"key":"9500_CR5","unstructured":"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\u2013690"},{"key":"9500_CR6","volume-title":"The mathematical theory of context-free languages","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg S (1966) The mathematical theory of context-free languages. McGraw-Hill, New York"},{"key":"9500_CR7","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","volume":"22","author":"E Gurari","year":"1981","unstructured":"Gurari E, Ibarra OH (1981) The complexity of decision problems for finite-turn multicounter machines. J Comput Syst Sci 22:220\u2013229","journal-title":"J Comput Syst Sci"},{"key":"9500_CR8","doi-asserted-by":"crossref","unstructured":"Hague M, Lin AW (2011) Model checking recursive programs with numeric data types. In: CAV 2011, pp 743\u2013759","DOI":"10.1007\/978-3-642-22110-1_60"},{"key":"9500_CR9","volume-title":"Introduction to automata, languages and computation","author":"JE Hopcroft","year":"1978","unstructured":"Hopcroft JE, Ullman JD (1978) Introduction to automata, languages and computation. Addison-Wesley, Reading"},{"key":"9500_CR10","doi-asserted-by":"crossref","unstructured":"Hussini S, Kari L, Konstantinidis S (2002) Coding properties of DNA languages. In: Proceeding of the 8th international meeting on DNA computing, pp 57\u201369","DOI":"10.1007\/3-540-48017-X_6"},{"issue":"1","key":"9500_CR11","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra OH (1978) Reversal-bounded multicounter machines and their decision problems. J ACM 25(1):116\u2013133","journal-title":"J ACM"},{"issue":"1","key":"9500_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1137\/S0097539792240625","volume":"24","author":"OH Ibarra","year":"1995","unstructured":"Ibarra OH, Jiang T, Tran NQ, Wang H (1995) New decidability results concerning two-way counter machines. SIAM J Comput 24(1):123\u2013137","journal-title":"SIAM J Comput"},{"issue":"2","key":"9500_CR13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s11047-004-4009-9","volume":"4","author":"N Jonoska","year":"2005","unstructured":"Jonoska N, Mahalingam K, Chen J (2005) Involution codes: with application to DNA coded languages. Nat Comput 4(2):141\u2013162","journal-title":"Nat Comput"},{"issue":"1,2","key":"9500_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FUN-2008-861-207","volume":"86","author":"N Jonoska","year":"2008","unstructured":"Jonoska N, Kari L, Mahalingam K (2008) Involution solid and join codes. Fundamenta Informaticae 86(1,2):127\u2013142","journal-title":"Fundamenta Informaticae"},{"key":"9500_CR15","doi-asserted-by":"crossref","unstructured":"Kari L, Mahalingham K (2006) DNA codes and their properties. In: Proceedings of the 12th international meeting on DNA computing, pp 127\u2013142","DOI":"10.1007\/11925903_10"},{"issue":"4","key":"9500_CR16","doi-asserted-by":"crossref","first-page":"453","DOI":"10.3233\/FUN-2006-71405","volume":"71","author":"L Kari","year":"2006","unstructured":"Kari L, Lossevsa E, Konstantinidis S, Sosik P, Thierrin G (2006) A formal language analysis of DNA hairpin structures. Fundamenta Informaticae 71(4):453\u2013475","journal-title":"Fundamenta Informaticae"},{"key":"9500_CR17","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M Minsky","year":"1961","unstructured":"Minsky M (1961) Recursive unsolvability of Post\u2019s problem of Tag and other topics in the theory of Turing machines. Ann Math 74:437\u2013455","journal-title":"Ann Math"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9500-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-015-9500-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9500-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T19:55:25Z","timestamp":1748375725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-015-9500-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,5]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9500"],"URL":"https:\/\/doi.org\/10.1007\/s11047-015-9500-y","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2015,5,5]]}}}