{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:38:35Z","timestamp":1753439915313},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,4,19]],"date-time":"2016-04-19T00:00:00Z","timestamp":1461024000000},"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":["Acta Informatica"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00236-016-0267-0","type":"journal-article","created":{"date-parts":[[2016,4,19]],"date-time":"2016-04-19T18:35:01Z","timestamp":1461090901000},"page":"487-499","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Reversible Watson\u2013Crick automata"],"prefix":"10.1007","volume":"54","author":[{"given":"Kingshuk","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Kumar Sankar","family":"Ray","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,19]]},"reference":[{"key":"267_CR1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennet","year":"1973","unstructured":"Bennet, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"267_CR2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-2011-541","volume":"110","author":"K Morita","year":"2011","unstructured":"Morita, K.: Two-way reversible multi-head finite automata. Fundam. Inform. 110, 241\u2013254 (2011)","journal-title":"Fundam. Inform."},{"key":"267_CR3","doi-asserted-by":"crossref","unstructured":"Kutrib, M., Malcher, A.: One-way reversible multi-head finite automata. In: Reversible Computation. Lecture Notes in Computer Science, vol. 7581, pp. 14\u201328 (2013)","DOI":"10.1007\/978-3-642-36315-3_2"},{"issue":"6","key":"267_CR4","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.1016\/j.jcss.2011.12.004","volume":"78","author":"M Kutrib","year":"2012","unstructured":"Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78(6), 1814\u20131827 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"267_CR5","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: On reversible automata. In: Proceedings of the first LATIN conference, Sao-Paulo, Brazil. Lecture Notes in Computer Science, vol. 583, pp. 401\u2013416. Springer (1992)","DOI":"10.1007\/BFb0023844"},{"key":"267_CR6","doi-asserted-by":"crossref","unstructured":"Freund, R., P\u0103un, G., Rozenberg, G., Salomaa, A.: Watson\u2013Crick finite automata. In: Proceedings of 3rd DIMACS Workshop on DNA Based Computers, Philadelphia, pp. 297\u2013328 (1997)","DOI":"10.1090\/dimacs\/048\/22"},{"key":"267_CR7","volume-title":"New Computing Paradigms","author":"G P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A., Computing, D.N.A.: New Computing Paradigms. Springer, Berlin (1998)"},{"issue":"35","key":"267_CR8","doi-asserted-by":"crossref","first-page":"3250","DOI":"10.1016\/j.tcs.2009.05.001","volume":"410","author":"E Czeizler","year":"2009","unstructured":"Czeizler, E., Czeizler, E., Kari, L., Salomaa, K.: On the descriptional complexity of Watson\u2013Crick automata. Theor. Comput. Sci. 410(35), 3250\u20133260 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"10A","key":"267_CR9","first-page":"26","volume":"4","author":"KS Ray","year":"2013","unstructured":"Ray, K.S., Chatterjee, K., Ganguly, D.: Equivalence of subclasses of two-way non-deterministic Watson-Crick automata. Appl. Math. 4(10A), 26\u201334 (2013)","journal-title":"Appl. Math."},{"key":"267_CR10","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1308\/147363506X101210","volume":"88","author":"E Czeizler","year":"2006","unstructured":"Czeizler, E., Czeizler, E.: A short survey on Watson\u2013Crick automata. Bull. EATCS 88, 104\u2013119 (2006)","journal-title":"Bull. EATCS"},{"key":"267_CR11","doi-asserted-by":"crossref","unstructured":"P\u0103un, A., P\u0103un, M.: State and transition complexity of Watson\u2013Crick finite automata. In: Fundamentals of Computation Theory, vol. 1684, pp. 409\u2013420. Lecture Notes in Computer Science (1999)","DOI":"10.1007\/3-540-48321-7_34"},{"issue":"4","key":"267_CR12","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1007\/s11047-015-9494-5","volume":"14","author":"KS Ray","year":"2015","unstructured":"Ray, K.S., Chatterjee, K., Ganguly, D.: State complexity of deterministic Watson\u2013Crick automata and time varying Watson\u2013Crick automata. Nat. Comput. 14(4), 691\u2013699 (2015)","journal-title":"Nat. Comput."},{"key":"267_CR13","doi-asserted-by":"crossref","unstructured":"Kuske, D., Weigel, P.:The role of the complementarity relation in Watson\u2013Crick automata and sticker systems. IN: Proceedings of DLT 2004. LNCS 3340, pp. 272\u2013283. Springer (2004)","DOI":"10.1007\/978-3-540-30550-7_23"},{"key":"267_CR14","unstructured":"Sempere, J.M.: Exploring regular reversibility in Watson\u2013Crick finite automata. In: The Thirteenth International Symposium on Artificial Life and Robotics 2008 (AROB 13th \u201908), B-Con Plaza, Beppu, Oita, Japan, January 31\u2013February 2 (2008)"},{"issue":"2","key":"267_CR15","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/322063.322076","volume":"25","author":"AC Yao","year":"1978","unstructured":"Yao, A.C., Rivest, R.L.: k + 1 Heads are better than k. J. ACM (JACM) 25(2), 337\u2013340 (1978)","journal-title":"J. ACM (JACM)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-016-0267-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0267-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0267-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-016-0267-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T21:45:47Z","timestamp":1600465547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-016-0267-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,19]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["267"],"URL":"https:\/\/doi.org\/10.1007\/s00236-016-0267-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,19]]}}}