{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:47:34Z","timestamp":1726408054957},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002640"},{"type":"electronic","value":"9783030002657"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00265-7_1","type":"book-chapter","created":{"date-parts":[[2018,9,14]],"date-time":"2018-09-14T09:14:01Z","timestamp":1536916441000},"page":"1-20","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Chocolate P Automata"],"prefix":"10.1007","author":[{"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudolf","family":"Freund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergiu","family":"Ivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marion","family":"Oswald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Verlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,15]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-36751-9_9","volume-title":"Membrane Computing","author":"Artiom Alhazov","year":"2013","unstructured":"Alhazov, A., Freund, R., Heikenw\u00e4lder, H., Oswald, M., Rogozhin, Yu., Verlan, S.: Sequential P systems with regular control. In: Csuhaj-Varj\u00fa, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, Gy. (eds.) CMC 2012. LNCS, vol. 7762, pp. 112\u2013127. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-36751-9_9"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.4204\/EPTCS.252.6","volume":"252","author":"Artiom Alhazov","year":"2017","unstructured":"Alhazov, A., Freund, R., Ivanov, S., Verlan, S.: (Tissue) P systems with vesicles of multisets. In: Csuhaj-Varj\u00fa, E., D\u00f6m\u00f6si, P., Vaszil, Gy. (eds.) Proceedings 15th International Conference on Automata and Formal Languages. AFL 2017, 4\u20136 September 2017, Debrecen, Hungary, vol. 252, pp. 11\u201325. EPTCS (2017). \nhttps:\/\/doi.org\/10.4204\/EPTCS.252.6","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 13\u201316 June 2004, Chicago, IL, USA, pp. 202\u2013211. ACM (2004). \nhttps:\/\/doi.org\/10.1145\/1007352.1007390","DOI":"10.1145\/1007352.1007390"},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 16:1\u201316:43 (2009). \nhttps:\/\/doi.org\/10.1145\/1516512.1516518","journal-title":"J. ACM"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-33475-7_3","volume-title":"Theoretical Computer Science","author":"S Bensch","year":"2012","unstructured":"Bensch, S., Holzer, M., Kutrib, M., Malcher, A.: Input-driven stack automata. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 28\u201342. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33475-7_3"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-12689-9_92","volume-title":"Foundations of Computation Theory","author":"B Braunm\u00fchl von","year":"1983","unstructured":"von Braunm\u00fchl, B., Verbeek, R.: Input-driven languages are recognized in log n space. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 40\u201351. Springer, Heidelberg (1983). \nhttps:\/\/doi.org\/10.1007\/3-540-12689-9_92"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-45523-X_4","volume-title":"Lecture Notes in Computer Science","author":"Erzs\u00e9bet Csuhaj-Varj\u00fa","year":"2001","unstructured":"Csuhaj-Varj\u00fa, E., Mart\u00edn-Vide, C., Mitrana, V.: Multiset automata. In: Calude, C.S., P\u0103un, Gh., Rozenberg, G., Salomaa, A. (eds.) WMC 2000. LNCS, vol. 2235, pp. 69\u201383. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45523-X_4"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-36490-0_14","volume-title":"Membrane Computing","author":"Erzs\u00e9bet Csuhaj-Varj\u00fa","year":"2003","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.) WMC 2002. LNCS, vol. 2597, pp. 219\u2013233. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-36490-0_14"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Dassow, J., P\u0103un, Gh.: On the power of membrane computing. J. UCS 5(2), 33\u201349 (1999). \nhttps:\/\/doi.org\/10.3217\/jucs-005-02-0033","DOI":"10.3217\/jucs-005-02-0033"},{"issue":"5","key":"1_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0020-0190(88)90148-2","volume":"26","author":"PW Dymond","year":"1988","unstructured":"Dymond, P.W.: Input-driven languages are in log n depth. Inf. Process. Lett. 26(5), 247\u2013250 (1988). \nhttps:\/\/doi.org\/10.1016\/0020-0190(88)90148-2","journal-title":"Inf. Process. Lett."},{"key":"1_CR11","unstructured":"Freund, R.: P automata: new ideas and results. In: Bordihn, H., Freund, R., Nagy, B., Vaszil, Gy. (eds.) Proceedings of Eighth Workshop on Non-Classical Models of Automata and Applications. NCMA 2016, 29\u201330 August 2016, Debrecen, Hungary, vol. 321, pp. 13\u201340. \u00d6sterreichische Computer Gesellschaft (2016). \nhttps:\/\/shop.ocg.at\/de\/books.html"},{"key":"1_CR12","unstructured":"Freund, R., Ibarra, O., P\u0103un, Gh., Yen, H.C.: Matrix languages, register machines, vector addition systems. In: Third Brainstorming Week on Membrane Computing, pp. 155\u2013167 (2005). \nhttps:\/\/www.gcn.us.es\/3BWMC\/bravolpdf\/bravol155.pdf"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.4204\/EPTCS.31.11","volume":"31","author":"Rudolf Freund","year":"2010","unstructured":"Freund, R., Kogler, M., Rogozhin, Yu., Verlan, S.: Graph-controlled insertion-deletion systems. In: Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems. DCFS 2010, 8\u201310 August 2010, Saskatoon, Canada, pp. 88\u201398 (2010). \nhttps:\/\/doi.org\/10.4204\/EPTCS.31.11","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.entcs.2007.05.011","volume":"171","author":"R Freund","year":"2007","unstructured":"Freund, R., Oswald, M.: Tissue P systems and (mem)brane systems with mate and drip operations working on strings. Electron. Notes Theor. Comput. Sci. 171(2), 105\u2013115 (2007). \nhttps:\/\/doi.org\/10.1016\/j.entcs.2007.05.011","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4204\/EPTCS.128.13","volume":"128","author":"Rudolf Freund","year":"2013","unstructured":"Freund, R., P\u0103un, Gh.: How to obtain computational completeness in P systems with one catalyst. In: Proceedings Machines, Computations and Universality 2013. MCU 2013, 9\u201311 September 2013, Z\u00fcrich, Switzerland, pp. 47\u201361 (2013). \nhttps:\/\/doi.org\/10.4204\/EPTCS.128.13","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s11047-013-9396-3","volume":"13","author":"Rudolf Freund","year":"2014","unstructured":"Freund, R., Rogozhin, Yu., Verlan, S.: Generating and accepting P systems with minimal left and right insertion and deletion. Nat. Comput. 13(2), 257\u2013268 (2014). \nhttps:\/\/doi.org\/10.1007\/s11047-013-9396-3","journal-title":"Natural Computing"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"SA Greibach","year":"1978","unstructured":"Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci. 7, 311\u2013324 (1978). \nhttps:\/\/doi.org\/10.1016\/0304-3975(78)90020-8","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"1_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.3233\/FI-2009-0098","volume":"93","author":"M Kudlek","year":"2009","unstructured":"Kudlek, M., Totzke, P., Zetzsche, G.: Multiset pushdown automata. Fundam. Inform. 93(1\u20133), 221\u2013233 (2009). \nhttps:\/\/doi.org\/10.3233\/FI-2009-0098","journal-title":"Fundam. Inform."},{"issue":"1\u20132","key":"1_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/FI-2017-1576","volume":"155","author":"M Kutrib","year":"2017","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Tinput-driven pushdown, counter, and stack automata. Fundam. Inform. 155(1\u20132), 59\u201388 (2017). \nhttps:\/\/doi.org\/10.3233\/FI-2017-1576","journal-title":"Fundam. Inform."},{"key":"1_CR20","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-73216-9_19","volume-title":"Reversibility and Universality","author":"M Kutrib","year":"2018","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Queue automata: foundations and developments. In: Adamatzky, A. (ed.) Reversibility and Universality. ECC, vol. 30, pp. 385\u2013431. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-73216-9_19"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-45655-4_32","volume-title":"Lecture Notes in Computer Science","author":"C. Mart\u00edn-Vide","year":"2002","unstructured":"Mart\u00edn-Vide, C., Pazos, J., P\u0103un, Gh., Rodr\u00edguez-Pat\u00f3n, A.: A new class of symbolic abstract neural nets: tissue P systems. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 290\u2013299. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45655-4_32"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-10003-2_89","volume-title":"Automata, Languages and Programming","author":"K Mehlhorn","year":"1980","unstructured":"Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL-recognition. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 422\u2013435. Springer, Heidelberg (1980). \nhttps:\/\/doi.org\/10.1007\/3-540-10003-2_89"},{"key":"1_CR23","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":"1_CR24","unstructured":"Okhotin, A., Salomaa, K.: Input-driven pushdown automata: nondeterminism and unambiguity. In: Bensch, S., Drewes, F., Freund, R., Otto, F. (eds.) Proceedings of Fifth Workshop on Non-Classical Models for Automata and Applications. NCMA 2013, 13\u201314 August 2013, Ume\u00e5, Sweden, vol. 294, pp. 31\u201333. \u00d6sterreichische Computer Gesellschaft (2013). \nhttps:\/\/shop.ocg.at\/de\/books.html"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-09698-8_9","volume-title":"Developments in Language Theory","author":"A Okhotin","year":"2014","unstructured":"Okhotin, A., Salomaa, K.: Input-driven pushdown automata with limited nondeterminism. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 84\u2013102. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09698-8_9"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.11.015","volume":"566","author":"A Okhotin","year":"2015","unstructured":"Okhotin, A., Salomaa, K.: Descriptional complexity of unambiguous input-driven pushdown automata. Theor. Comput. Sci. 566, 1\u201311 (2015). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2014.11.015","journal-title":"Theor. Comput. Sci."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jcss.2017.02.001","volume":"86","author":"A Okhotin","year":"2017","unstructured":"Okhotin, A., Salomaa, K.: State complexity of operations on input-driven pushdown automata. J. Comput. Syst. Sci. 86, 207\u2013228 (2017). \nhttps:\/\/doi.org\/10.1016\/j.jcss.2017.02.001","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR28","unstructured":"Oswald, M.: P automata. Ph.D. thesis, Faculty of Computer Science, TU Wien (2003)"},{"issue":"3","key":"1_CR29","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF03037362","volume":"20","author":"Andrei P\u00e2un","year":"2002","unstructured":"P\u0103un, A., P\u0103un, Gh.: The power of communication: P systems with symport\/antiport. New Gener. Comput. 20(3), 295\u2013306 (2002). \nhttps:\/\/doi.org\/10.1007\/BF03037362","journal-title":"New Generation Computing"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"Gheorghe P\u0103un","year":"2000","unstructured":"P\u0103un, Gh.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108\u2013143 (2000). \nhttps:\/\/doi.org\/10.1006\/jcss.1999.1693","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.tcs.2012.01.036","volume":"454","author":"Gheorghe P\u0103un","year":"2012","unstructured":"P\u0103un, Gh., P\u00e9rez-Jim\u00e9nez, M.J.: P automata revisited. Theor. Comput. Sci. 454, 222\u2013230 (2012). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2012.01.036","journal-title":"Theoretical Computer Science"},{"key":"1_CR32","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"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"1_CR33","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1\u20133. Springer, Heidelberg (1997)"},{"key":"1_CR34","unstructured":"Bulletin of the International Membrane Computing Society (IMCS). \nhttp:\/\/membranecomputing.net\/IMCSBulletin\/index.php"},{"key":"1_CR35","unstructured":"The P Systems Website. \nhttp:\/\/ppage.psystems.eu\/"}],"container-title":["Lecture Notes in Computer Science","Enjoying Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00265-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,14]],"date-time":"2018-09-14T09:14:37Z","timestamp":1536916477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00265-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002640","9783030002657"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00265-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}