{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:23Z","timestamp":1725488003605},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_52","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T11:16:31Z","timestamp":1185275791000},"page":"497-506","source":"Crossref","is-referenced-by-count":2,"title":["On Accepting Networks of Splicing Processors of Size 3"],"prefix":"10.1007","author":[{"given":"Remco","family":"Loos","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s00236-003-0114-y","volume":"39","author":"J. Castellanos","year":"2003","unstructured":"Castellanos, J., Martin-Vide, C., Mitrana, V., Sempere, J.: Networks of evolutionary processors. Acta Informatica\u00a039, 517\u2013529 (2003)","journal-title":"Acta Informatica"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.tcs.2004.07.035","volume":"330","author":"J. Castellanos","year":"2005","unstructured":"Castellanos, J., Leupold, P., Mitrana, V.: Descriptional and computational complexity aspects of hybrid networks of evolutionary processors. Theoretical Computer Science\u00a0330, 205\u2013220 (2005)","journal-title":"Theoretical Computer Science"},{"key":"52_CR3","first-page":"163","volume-title":"Pacific Symposium on BIOCOMPUTING\u201997","author":"R. Freund","year":"1997","unstructured":"Freund, R., Csuhaj-Varj\u00fa, E., Wachtler, F.: Test Tube Systems with Cutting\/Recombination Operations. In: Pacific Symposium on BIOCOMPUTING\u201997, pp. 163\u2013175. World Scientific, Singapore (1997)"},{"key":"52_CR4","unstructured":"Hopcroft, J E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation (1979)"},{"issue":"1-2","key":"52_CR5","first-page":"72","volume":"371","author":"F. Manea","year":"2007","unstructured":"Manea, F., Martin-Vide, C., Mitrana, V.: Accepting networks of splicing processors: Complexity results. Theoretical Computer Science (CiE 2005 special issue)\u00a0371(1-2), 72\u201382 (2007)","journal-title":"Theoretical Computer Science, (CiE 2005 special issue)"},{"key":"52_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/11925903_4","volume-title":"DNA Computing","author":"F. Manea","year":"2006","unstructured":"Manea, F., Martin-Vide, C., Mitrana, V.: All NP-problems can be solved in polynomial time by accepting networks of splicing processors of constant size. In: Mao, C., Yokomori, T. (eds.) DNA Computing. LNCS, vol.\u00a04287, pp. 47\u201357. Springer, Heidelberg (2006)"},{"key":"52_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/11493785_21","volume-title":"Accepting hybrid networks of evolutionary systems","author":"M. Margenstern","year":"2005","unstructured":"Margenstern, M., Mitrana, V., Perez-Jimenez, M.: Accepting hybrid networks of evolutionary systems. LNCS, vol.\u00a03384, pp. 235\u2013246. Springer, Heidelberg (2005)"},{"key":"52_CR8","volume-title":"Where Mathematics, Computer Science and Biology Meet","author":"M. Margenstern","year":"2000","unstructured":"Margenstern, M., Rogozhin, Y.: Time-varying distributed H systems of degree 2 generate all recursively enumerable languages. In: Martin-Vide, C., Mitrana, V. (eds.) Where Mathematics, Computer Science and Biology Meet, Kluwer Academic, Dordrecht (2000)"},{"key":"52_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-36440-4_29","volume-title":"DNA8","author":"M. Margenstern","year":"2003","unstructured":"Margenstern, M., Rogozhin, Y., Verlan, S.: Time-varying distributed H systems of degree 2 can carry out parallel computations. In: DNA8. LNCS, vol.\u00a02568, pp. 326\u2013336. Springer, Heidelberg (2003)"},{"key":"52_CR10","unstructured":"Papadimitriou, C.H.: Computational Complexity (1994)"},{"issue":"1","key":"52_CR11","first-page":"27","volume":"1","author":"G. P\u0103un","year":"1996","unstructured":"P\u0103un, Gh.: Regular extended H systems are computationally universal. J. Automata, languages, Combinatorics\u00a01(1), 27\u201336 (1996)","journal-title":"J. Automata, languages, Combinatorics"},{"key":"52_CR12","first-page":"157","volume":"67","author":"A. P\u0103un","year":"1999","unstructured":"P\u0103un, A.: On time-varying H systems. Bulletin of the EATCS\u00a067, 157\u2013164 (1999)","journal-title":"Bulletin of the EATCS"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T03:56:27Z","timestamp":1550462187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}