{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:04:00Z","timestamp":1725577440012},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_21","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"191-200","source":"Crossref","is-referenced-by-count":2,"title":["Two-Party Watson-Crick Computations"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.tcs.2006.01.049","volume":"358","author":"E. Czeizler","year":"2006","unstructured":"Czeizler, E., Czeizler, E.: On the power of parallel communicating Watson-Crick automata systems. Theoret. Comput. Sci.\u00a0358, 142\u2013147 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR2","doi-asserted-by":"publisher","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-Crick automata. Theoret. Comput. Sci.\u00a0410, 3250\u20133260 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR3","unstructured":"Freund, R., P\u0103un, G., Rozenberg, G., Salomaa, A.: Watson-Crick finite automata. In: DIMACS Workshop on DNA Based Computers, University of Pennsylvania, pp. 305\u2013317 (1997)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1090\/psapm\/019\/0235938","volume":"19","author":"J. Hartmanis","year":"1967","unstructured":"Hartmanis, J.: Context-free languages and Turing machine computations. Proc. Symposia in Applied Mathematics\u00a019, 42\u201351 (1967)","journal-title":"Proc. Symposia in Applied Mathematics"},{"key":"21_CR5","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. ACM\u00a025, 116\u2013133 (1978)","journal-title":"J. ACM"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1007\/3-540-48224-5_85","volume-title":"Automata, Languages and Programming","author":"T. Jurdzi\u0144ski","year":"2001","unstructured":"Jurdzi\u0144ski, T., Kuty\u0142owski, M.: Communication gap for finite memory devices. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 1052\u20131064. Springer, Heidelberg (2001)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-48686-0_32","volume-title":"Computing and Combinatorics","author":"T. Jurdzi\u0144ski","year":"1999","unstructured":"Jurdzi\u0144ski, T., Kuty\u0142owski, M., Lory\u015b, K.: Multi-party finite computations. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 318\u2013329. Springer, Heidelberg (1999)"},{"key":"21_CR8","unstructured":"Leupold, P., Nagy, B.: 5\u2032\u21923\u2032 Watson-Crick automata with several runs. In: Non-Classical Models of Automata and Applications (NCMA 2009). books@ocg.at, vol.\u00a0256, pp. 167\u2013180. Austrian Computer Society (2009)"},{"key":"21_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1993","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Heidelberg (1993)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1142\/S0129054102001424","volume":"13","author":"C. Mart\u00edn-Vide","year":"2002","unstructured":"Mart\u00edn-Vide, C., Mateescu, A., Mitrana, V.: Parallel finite automata systems communicating by states. Int. J. Found. Comput. Sci.\u00a013, 733\u2013749 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"21_CR11","first-page":"301","volume":"5","author":"V. Mitrana","year":"2000","unstructured":"Mitrana, V.: On the degree of communication in parallel communicating finite automata systems. J. Autom. Lang. Comb.\u00a05, 301\u2013314 (2000)","journal-title":"J. Autom. Lang. Comb."},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-77962-9_27","volume-title":"DNA Computing","author":"B. Nagy","year":"2008","unstructured":"Nagy, B.: On 5\u2032\u21923\u2032 sensing Watson-Crick finite automata. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol.\u00a04848, pp. 256\u2013262. Springer, Heidelberg (2008)"},{"key":"21_CR13","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"G. P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Texts in Theoretical Computer Science. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T06:59:08Z","timestamp":1553410748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}