{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:24:41Z","timestamp":1725582281405},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642193903"},{"type":"electronic","value":"9783642193910"}],"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-19391-0_8","type":"book-chapter","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T08:53:35Z","timestamp":1303980815000},"page":"102-115","source":"Crossref","is-referenced-by-count":8,"title":["P and dP Automata: A Survey"],"prefix":"10.1007","author":[{"given":"Gheorghe","family":"P\u0103un","sequence":"first","affiliation":[]},{"given":"Mario J.","family":"P\u00e9rez-Jim\u00e9nez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Adorna, H., P\u0103un, G., P\u00e9rez-Jim\u00e9nez, M.J.: On communication complexity in evolution-communication P systems. In: Proc. 8th Brainstorming Week on Membrane Computing, Sevilla, and Romanian J. Information Theory and Applications (February 2010) (to appear)"},{"key":"8_CR2","unstructured":"Colomer, M.A., Lav\u00edn, S., Marco, I., Margalida, A., P\u00e9rez-Hurtado, I., P\u00e9rez-Jim\u00e9nez, M.J., Sanuy, D., Serrano, E., Valencia-Cabrera, L.: Studying the evolution of Pyrenean Chamois by using P systems. In: Pre-proc. Conf. on Membrane Computing, CMC11, Jena, Germany (August 2010)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-31837-8_2","volume-title":"Membrane Computing","author":"E. Csuhaj-Varj\u00fa","year":"2005","unstructured":"Csuhaj-Varj\u00fa, E.: P automata. In: Mauri, G., et al. (eds.) WMC 2004. LNCS, vol.\u00a03365, pp. 19\u201335. Springer, Heidelberg (2005)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11047-005-4461-1","volume":"5","author":"E. Csuhaj-Varj\u00fa","year":"2006","unstructured":"Csuhaj-Varj\u00fa, E., Ibarra, O.H., Vaszil, G.: On the computational complexity of P automata. Natural Computing\u00a05, 109\u2013126 (2006)","journal-title":"Natural Computing"},{"key":"8_CR5","unstructured":"Csuhaj-Varj\u00fa, E., Oswald, M., Vaszil, G.: P automata. In: [17], ch. 6, pp. 144\u2013167"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-36490-0_14","volume-title":"Membrane Computing","author":"E. Csuhaj-Varj\u00fa","year":"2003","unstructured":"Csuhaj-Varj\u00fa, E., Vaszil, G.: P automata or purely communicating accepting P systems. In: P\u0103un, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 219\u2013233. Springer, Heidelberg (2003)"},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/11963516_23","volume-title":"Membrane Computing","author":"J. Dassow","year":"2006","unstructured":"Dassow, J., Vaszil, G.: P finite automata and regular languages over countably infinite alphabets. In: Hoogeboom, H.J., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol.\u00a04361, pp. 367\u2013381. Springer, Heidelberg (2006)"},{"key":"8_CR9","unstructured":"Freund, R., Kogler, M., P\u0103un, G., P\u00e9rez-Jim\u00e9nez, M.J.: On the power of P and dP automata. In: Annals of Bucharest University. Mathematics-Informatics Series (2010) (in press)"},{"key":"8_CR10","first-page":"231","volume":"79","author":"R. Freund","year":"2002","unstructured":"Freund, R., Oswald, M.: A short note on analysing P systems. Bulletin of the EATCS\u00a079, 231\u2013236 (2002)","journal-title":"Bulletin of the EATCS"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-24619-0_15","volume-title":"Membrane Computing","author":"R. Freund","year":"2004","unstructured":"Freund, R., Oswald, M., Staiger, L.: \u03c9-P automata with communication rules. In: Martin-Vide, C., et al. (eds.) WMC 2003. LNCS, vol.\u00a02933, pp. 203\u2013217. Springer, Heidelberg (2004)"},{"key":"8_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03442-2","volume-title":"Communication Complexity and Parallel Computing: The Application of Communication Complexity in Parallel Computing","author":"J. Hromkovic","year":"1997","unstructured":"Hromkovic, J.: Communication Complexity and Parallel Computing: The Application of Communication Complexity in Parallel Computing. Springer, Berlin (1997)"},{"key":"8_CR13","unstructured":"Oswald, M.: P Automata. PhD Thesis, TU Vienna (2003)"},{"key":"8_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8969-7","volume-title":"Marcus Contextual Grammars","author":"G. P\u0103un","year":"1997","unstructured":"P\u0103un, G.: Marcus Contextual Grammars. Kluwer, Dordrecht (1997)"},{"key":"8_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing. An Introduction","author":"G. P\u0103un","year":"2002","unstructured":"P\u0103un, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"238","DOI":"10.15837\/ijccc.2010.2.2478","volume":"5","author":"G. P\u0103un","year":"2010","unstructured":"P\u0103un, G., P\u00e9rez-Jim\u00e9nez, M.J.: Solving problems in a distributed way in membrane computing: dP systems. Int. J. of Computers, Communication and Control\u00a05(2), 238\u2013252 (2010)","journal-title":"Int. J. of Computers, Communication and Control"},{"volume-title":"Handbook of Membrane Computing","year":"2010","key":"8_CR17","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.): Handbook of Membrane Computing. Oxford University Press, Oxford (2010)"},{"key":"8_CR18","volume-title":"The Mathematical Theory of L Systems","author":"G. Rozenberg","year":"1980","unstructured":"Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)"},{"volume-title":"Handbook of Formal Languages","year":"1998","key":"8_CR19","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, 3 volumes. Springer, Berlin (1998)"},{"key":"8_CR20","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"8_CR21","unstructured":"The P Systems Website, \n                    \n                      http:\/\/ppage.psystems.eu"}],"container-title":["Lecture Notes in Computer Science","Rainbow of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19391-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T05:45:39Z","timestamp":1558590339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19391-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642193903","9783642193910"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19391-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}