{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:53:31Z","timestamp":1743065611173,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218182"},{"type":"electronic","value":"9783319218199"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21819-9_12","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T11:16:31Z","timestamp":1438600591000},"page":"169-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\\omega $$-Languages"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Freund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergiu","family":"Ivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludwig","family":"Staiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Alhazov, A., Aman, B., Freund, R.: P systems with anti-matter. In: [10], pp. 66\u201385","DOI":"10.1007\/978-3-319-14370-5_5"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Aman, B., Csuhaj-Varj\u00fa, E., Freund, R.: Red\u2013green P automata. In: [10], pp. 139\u2013157","DOI":"10.1007\/978-3-319-14370-5_9"},{"key":"12_CR3","volume-title":"What Is and What Will Be","author":"P Budnik","year":"2006","unstructured":"Budnik, P.: What Is and What Will Be. Mountain Math Software, Los Gatos (2006)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Calude, C.S., P\u0103un, Gh.: Bio-steps beyond Turing. Biosystems 77, 175\u2013194 (2004)","DOI":"10.1016\/j.biosystems.2004.05.032"},{"issue":"6","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1017\/S0960129510000344","volume":"20","author":"CS Calude","year":"2010","unstructured":"Calude, C.S., Staiger, L.: A note on accelerated Turing machines. Math. Struct. Comput. Sci. 20(6), 1011\u20131017 (2010)","journal-title":"Math. Struct. Comput. Sci."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Csuhaj-Varj\u00fa, E., Vaszil, Gy.: P automata or purely communicating accepting P systems. In: P\u0103un, Gh., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) Membrane Computing. Lecture Notes in Computer Science, vol. 2597, pp. 219\u2013233. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36490-0_14"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1080\/00207160.2012.748899","volume":"90","author":"R Freund","year":"2013","unstructured":"Freund, R., P\u00e9rez-Hurtado, I., Riscos-N\u00fa\u00f1ez, A., Verlan, S.: A formalization of membrane systems with dynamically evolving structures. Int. J. Comput. Math. 90(4), 801\u2013815 (2013)","journal-title":"Int. J. Comput. Math."},{"key":"12_CR8","first-page":"231","volume":"78","author":"R Freund","year":"2002","unstructured":"Freund, R., Oswald, M.: A short note on analysing P systems. Bull. EATCS 78, 231\u2013236 (2002)","journal-title":"Bull. EATCS"},{"key":"12_CR9","unstructured":"Freund, R., Oswald, M., Staiger, L.: $${\\omega }$$-P automata with communication rules. In: Mart\u00edn-Vide, C., Mauri, G., P\u0103un, Gh., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 203\u2013217. Springer, Heidelberg (2004)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/978-3-319-14370-5_2","volume-title":"Membrane Computing","author":"MJ P\u00e9rez-Jim\u00e9nez","year":"2014","unstructured":"P\u00e9rez-Jim\u00e9nez, M.J.: A bioinspired computing approach to model complex systems. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Sos\u00edk, P., Zandron, C. (eds.) CMC 2014. LNCS, vol. 8961, pp. 20\u201334. Springer, Heidelberg (2014)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.tcs.2011.12.040","volume":"429","author":"J van Leeuwen","year":"2012","unstructured":"van Leeuwen, J., Wiedermann, J.: Computation as an unbounded process. Theor. Comput. Sci. 429, 202\u2013212 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR12","volume-title":"Computation: Finite and Infinite Machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"P\u0103un, Gh.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108\u2013143 (2000). (and Turku Center for Computer Science-TUCS Report 208, November 1998. http:\/\/www.tucs.fi)","DOI":"10.1006\/jcss.1999.1693"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"P\u0103un, Gh.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)","DOI":"10.1007\/978-3-642-56196-2"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"P\u0103un, Gh., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)","DOI":"10.1007\/978-3-642-11467-0"},{"key":"12_CR16","series-title":"Pure and Applied Mathematics","volume-title":"Infinite Words","author":"D Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-\u00c9.: Infinite Words. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)"},{"volume-title":"Handbook of Formal Languages: 3 volumes","year":"1997","key":"12_CR17","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages: 3 volumes. Springer, Heidelberg (1997)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Sos\u00edk, P., Val\u00edk, O.: On evolutionary lineages of membrane systems. In: Freund, R., P\u0103un, Gh., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 67\u201378. Springer, Heidelberg (2006)","DOI":"10.1007\/11603047_5"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","volume":"27","author":"L Staiger","year":"1983","unstructured":"Staiger, L.: Finite-state $$\\omega $$-languages. J. Comput. Syst. Sci. 27(3), 434\u2013448 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR20","first-page":"393","volume-title":"Theory of Algorithms (Colloquia Mathematica Societatis Janos Bolyai)","author":"L Staiger","year":"1986","unstructured":"Staiger, L.: $$\\omega $$-computations on Turing machines and the accepted languages. In: Lov\u00e1sz, L., Szemer\u00e9di, E. (eds.) Theory of Algorithms (Colloquia Mathematica Societatis Janos Bolyai), vol. 44, pp. 393\u2013403. North Holland, Amsterdam (1986)"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Staiger, L.: $$\\omega $$-languages. In: [17], vol. 3, pp. 339\u2013387","DOI":"10.1007\/978-3-642-59126-6_6"},{"issue":"7","key":"12_CR22","first-page":"379","volume":"10","author":"L Staiger","year":"1974","unstructured":"Staiger, L., Wagner, K.: Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regul\u00e4rer Folgenmengen. Elektron. Informationsverarb. Kybernetik 10(7), 379\u2013392 (1974)","journal-title":"Elektron. Informationsverarb. Kybernetik"},{"key":"12_CR23","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 133\u2013192. North Holland, Amsterdam (1990)"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K Wagner","year":"1979","unstructured":"Wagner, K.: On $$\\omega $$-regular sets. Inf. Control 43(2), 123\u2013177 (1979)","journal-title":"Inf. Control"},{"key":"12_CR25","unstructured":"The P Systems Website. http:\/\/www.ppage.psystems.eu"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21819-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T11:24:45Z","timestamp":1676028285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21819-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218182","9783319218199"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21819-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}