{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T15:10:01Z","timestamp":1746371401784,"version":"3.40.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112947"},{"type":"electronic","value":"9783319112954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11295-4_10","type":"book-chapter","created":{"date-parts":[[2014,9,8]],"date-time":"2014-09-08T14:35:40Z","timestamp":1410186940000},"page":"148-160","source":"Crossref","is-referenced-by-count":3,"title":["On Decidability and Closure Properties of Language Classes with Respect to Bio-operations"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-08123-6_8","volume-title":"Unconventional Computation and Natural Computation","author":"D.-J. Cho","year":"2014","unstructured":"Cho, D.-J., Han, Y.-S., Kang, S.-D., Kim, H., Ko, S.-K., Salomaa, K.: Pseudo-inversion on formal languages. In: Ibarra, O.H., Kari, L., Kopecki, S. (eds.) UCNC 2014. LNCS, vol.\u00a08553, pp. 93\u2013104. Springer, Heidelberg (2014)"},{"issue":"1-3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0304-3975(03)00139-7","volume":"306","author":"M. Daley","year":"2003","unstructured":"Daley, M., Ibarra, O.H., Kari, L.: Closure and decidability properties of some languages classes with respect to ciliate bio-operations. Theoret. Comput. Sci.\u00a0306(1-3), 19\u201338 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","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.: Families of languages defined by ciliate bio-operations. Theoret. Comput. Sci.\u00a0320(1), 51\u201369 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR4","unstructured":"Deaton, R., Garzon, M., Murphy, R.C., Rose, J.A., Franceschetti, D.R., Stevens Jr., S.E.: Genetic search of reliable encodings for DNA-based computation. In: Proc. of 1st Conf. on Genetic Programming, pp. 9\u201315 (1996)"},{"key":"10_CR5","unstructured":"Garzon, M., Deaton, R., Nino, L.F., Stevens, E., Wittner, M.: Encoding genomes for DNA computing. In: Genetic Programming 1998: Proc. of 3rd Annual Conf., pp. 684\u2013690 (1998)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","volume":"22","author":"E. Gurari","year":"1981","unstructured":"Gurari, E., Ibarra, O.H.: The complexity of decision problems for finite-turn multicounter machines. J. Comput. Syst. Sci.\u00a022, 220\u2013229 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22110-1_60","volume-title":"Computer Aided Verification","author":"M. Hague","year":"2011","unstructured":"Hague, M., Lin, A.W.: Model checking recursive programs with numeric data types. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 743\u2013759. Springer, Heidelberg (2011)"},{"key":"10_CR8","unstructured":"Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages"},{"key":"10_CR9","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata, Languages and Computation. Addison-Wesley (1978)"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. of the ACM\u00a025(1), 116\u2013133 (1978)","journal-title":"J. of the ACM"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1137\/S0097539792240625","volume":"24","author":"O.H. Ibarra","year":"1995","unstructured":"Ibarra, O.H., Jiang, T., Tran, N.Q., Wang, H.: New decidability results concerning two-way counter machines. SIAM J. Comput.\u00a024(1), 123\u2013137 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1,2","key":"10_CR12","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.: Involution solid and join codes. Fundamenta Informaticae\u00a086(1,2), 127\u2013142 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s11047-004-4009-9","volume":"4","author":"N. Jonoska","year":"2005","unstructured":"Jonoska, N., Mahalingam, K., Chen, J.: Involution codes: with application to DNA coded languages. Natural Computing\u00a04(2), 141\u2013162 (2005)","journal-title":"Natural Computing"},{"issue":"4","key":"10_CR14","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.: A formal language analysis of DNA hairpin structures. Fundamenta Informaticae\u00a071(4), 453\u2013475 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11925903_10","volume-title":"DNA Computing","author":"L. Kari","year":"2006","unstructured":"Kari, L., Mahalingam, K.: DNA codes and their properties. In: Mao, C., Yokomori, T. (eds.) DNA12. LNCS, vol.\u00a04287, pp. 127\u2013142. Springer, Heidelberg (2006)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Minsky, M.: Recursive unsolvability of Post\u2019s problem of Tag and other topics in the theory of Turing machines. Ann. of Math.\u00a0(74), 437\u2013455 (1961)","DOI":"10.2307\/1970290"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11295-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T14:35:17Z","timestamp":1746369317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11295-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112947","9783319112954"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11295-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}