{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:58Z","timestamp":1759638358028},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,12,18]],"date-time":"2009-12-18T00:00:00Z","timestamp":1261094400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00236-009-0113-8","type":"journal-article","created":{"date-parts":[[2009,12,17]],"date-time":"2009-12-17T03:17:45Z","timestamp":1261019865000},"page":"133-146","source":"Crossref","is-referenced-by-count":13,"title":["Small universal accepting hybrid networks of evolutionary processors"],"prefix":"10.1007","volume":"47","author":[{"given":"Remco","family":"Loos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,18]]},"reference":[{"key":"113_CR1","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-3-540-88282-4_5","volume":"5196","author":"A. Alhazov","year":"2008","unstructured":"Alhazov A., Csuhaj-Varju E., Martin-Vide C., Rogozhin Y.: About universal hybrid networks of evolutionary processors of small size. Lect. Notes Comput. Sci. 5196, 28\u201339 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"35","key":"113_CR2","doi-asserted-by":"crossref","first-page":"3188","DOI":"10.1016\/j.tcs.2009.05.003","volume":"410","author":"A. Alhazov","year":"2009","unstructured":"Alhazov A., Csuhaj-Varju E., Martin-Vide C., Rogozhin Y.: On the size of computationally complete hybrid networks of evolutionary processors. Theor. Comput. Sci. 410(35), 3188\u20133197 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"113_CR3","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"Hartmanis J., Stearns R.E.: On the computational complexity of algorithms. Trans. Am. Math. Soc. 117, 533\u2013546 (1965)","journal-title":"Trans. Am. Math. Soc."},{"key":"113_CR4","volume-title":"The Connection Machine","author":"W.D. Hillis","year":"1985","unstructured":"Hillis W.D.: The Connection Machine. MIT, Cambridge (1985)"},{"issue":"4","key":"113_CR5","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1017\/S0960129507006202","volume":"17","author":"F. Manea","year":"2007","unstructured":"Manea F., Martin-Vide C., Mitrana V.: On the size complexity of universal accepting hybrid networks of evolutionary processors. Math. Struct. Comput. Sci. 17(4), 753\u2013771 (2007)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"3","key":"113_CR6","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.ipl.2007.03.001","volume":"103","author":"F. Manea","year":"2007","unstructured":"Manea F., Mitrana V.: All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size. Inf. Proc. Lett. 103(3), 112\u2013118 (2007)","journal-title":"Inf. Proc. Lett."},{"key":"113_CR7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/11493785_21","volume":"3384","author":"M. Margenstern","year":"2005","unstructured":"Margenstern M., Mitrana V., Perez-Jimenez M.: Accepting hybrid networks of evolutionary systems. Lect. Notes Comput. Sci. 3384, 235\u2013246 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"key":"113_CR8","doi-asserted-by":"crossref","unstructured":"Minsky, M.L.: Size and structure of universal turing machines using tag systems. Recursive Function Theory, Symposium in Pure Mathematics, vol. 5, pp. 229\u2013238 (1962)","DOI":"10.1090\/pspum\/005\/0142452"},{"key":"113_CR9","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"113_CR10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"E.L. Post","year":"1943","unstructured":"Post E.L.: Formal reductions of the general combinatorial decision problem. Am. J. Math. 65, 197\u2013215 (1943)","journal-title":"Am. J. Math."},{"key":"113_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0304-3975(96)00077-1","volume":"168","author":"Y. Rogozhin","year":"1996","unstructured":"Rogozhin Y.: Small universal turing machines. Theor. Comput. Sci. 168, 215\u2013240 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"113_CR12","volume-title":"Handbook of Formal Languages, vol. I\u2013III","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds): Handbook of Formal Languages, vol. I\u2013III. Springer, Berlin (1997)"},{"key":"113_CR13","doi-asserted-by":"crossref","first-page":"6575","DOI":"10.1073\/pnas.89.14.6575","volume":"89","author":"D. Sankoff","year":"1992","unstructured":"Sankoff D. et\u00a0al.: Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89, 6575\u20136579 (1992)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"113_CR14","doi-asserted-by":"crossref","unstructured":"Woods, D., Neary, T.:On the time complexity of 2-tag systems and small universal Turing machines. 47th Annual IEEE symposium on foundations of computer science FOCS \u201906, pp. 439\u2013448 (2006)","DOI":"10.1109\/FOCS.2006.58"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0113-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-009-0113-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0113-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T15:38:32Z","timestamp":1558712312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-009-0113-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,18]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["113"],"URL":"https:\/\/doi.org\/10.1007\/s00236-009-0113-8","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,18]]}}}