{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:59:08Z","timestamp":1725890348914},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316227"},{"type":"electronic","value":"9783642316234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31623-4_5","type":"book-chapter","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T05:03:34Z","timestamp":1341810214000},"page":"64-75","source":"Crossref","is-referenced-by-count":1,"title":["Uniform Distributed Pushdown Automata Systems"],"prefix":"10.1007","author":[{"given":"Fernando","family":"Arroyo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Castellanos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-21254-3_10","volume-title":"Language and Automata Theory and Applications","author":"M. Berglund","year":"2011","unstructured":"Berglund, M., Bj\u00f6rklund, H., H\u00f6gberg, J.: Recognizing Shuffled Languages. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 142\u2013154. Springer, Heidelberg (2011)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1142\/S0129054111008891","volume":"22","author":"H. Bordihn","year":"2011","unstructured":"Bordihn, H., Kutrib, M., Malcher, A.: Undecidability and hierarchy results for parallel communicating finite automata. Int. J. Found. Comput. Sci.\u00a022, 1577\u20131592 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR3","first-page":"137","volume":"41","author":"A. Choudhary","year":"2007","unstructured":"Choudhary, A., Krithivasan, K., Mitrana, V.: Returning and non-returning parallel communicating finite automata are equivalent. Information Processing Letters\u00a041, 137\u2013145 (2007)","journal-title":"Information Processing Letters"},{"key":"5_CR4","first-page":"49","volume":"26","author":"E. Csuhaj-Varju","year":"1990","unstructured":"Csuhaj-Varju, E., Dassow, J.: On cooperating distributed grammar systems. J. Inform. Process. Cybern., EIK\u00a026, 49\u201363 (1990)","journal-title":"J. Inform. Process. Cybern., EIK"},{"key":"5_CR5","unstructured":"Csuhaj-Varju, E., Dassow, J., Kelemen, J., P\u0103un, G.: Grammar Systems. A grammatical approach to distribution and cooperation. Gordon and Breach (1994)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1142\/S0129054100000338","volume":"11","author":"E. Csuhaj-Varju","year":"2000","unstructured":"Csuhaj-Varju, E., Mart\u00edn-Vide, C., Mitrana, V., Vaszil, G.: Parallel communicating pushdown automata systems. Int. J. Found. Comput. Sci.\u00a011, 633\u2013650 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/3-540-45007-6_17","volume-title":"Developments in Language Theory","author":"E. Csuhaj-Varju","year":"2003","unstructured":"Csuhaj-Varju, E., Mitrana, V., Vaszil, G.: Distributed Pushdown Automata Systems: Computational Power. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 218\u2013229. Springer, Heidelberg (2003)"},{"key":"5_CR8","unstructured":"Dassow, J., P\u0103un, G., Rozenberg, G.: Grammar systems. In: [16], vol. 2"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1006\/jcss.1998.1610","volume":"58","author":"J. Dassow","year":"1999","unstructured":"Dassow, J., Mitrana, V.: Stack cooperation in multi-stack pushdown automata. J. Comput. System Sci.\u00a058, 611\u2013621 (1999)","journal-title":"J. Comput. System Sci."},{"key":"5_CR10","volume-title":"The Handbook of AI","author":"E.H. Durfee","year":"1989","unstructured":"Durfee, E.H., et al.: Cooperative distributed problem solving. In: Barr, A., Cohen, P.R., Feigenbaum, E.A. (eds.) The Handbook of AI, vol.\u00a04. Addison-Wesley, Reading (1989)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1142\/S0129054199000319","volume":"10","author":"K. Krithivasan","year":"1999","unstructured":"Krithivasan, K., Sakthi Balan, M., Harsha, P.: Distributed processing in automata. Int. J. Found. Comput. Sci.\u00a010, 443\u2013464 (1999)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0020-0190(00)00159-9","volume":"77","author":"C. Mart\u00edn-Vide","year":"2001","unstructured":"Mart\u00edn-Vide, C., Mitrana, V.: Some undecidable problems for parallel communicating finite automata systems. Information Processing Letters\u00a077, 239\u2013245 (2001)","journal-title":"Information Processing Letters"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1142\/S0129054102001424","volume":"13","author":"C. Mart\u00edn-Vide","year":"2002","unstructured":"Mart\u00edn-Vide, C., Mateescu, A., Mitrana, V.: Parallel finite automata systems communicating by states. Int. J. Found. Comput. Sci.\u00a013, 733\u2013749 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-08921-7_84","volume-title":"Mathematical Foundations of Computer Science 1978","author":"R. Meersman","year":"1978","unstructured":"Meersman, R., Rozenberg, G.: Cooperating Grammar Systems. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol.\u00a064, pp. 364\u2013374. Springer, Heidelberg (1978)"},{"key":"5_CR15","first-page":"55","volume":"38","author":"G. P\u0103un","year":"1989","unstructured":"P\u0103un, G., S\u00e2ntean, L.: Parallel communicating grammar systems: the regular case. Ann. Univ. Bucharest, Ser. Matem.-Inform.\u00a038, 55\u201363 (1989)","journal-title":"Ann. Univ. Bucharest, Ser. Matem.-Inform."},{"key":"5_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5","volume-title":"Handbook of Formal Languages","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol.\u00a01-3. Springer, Berlin (1997)"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31623-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:40:40Z","timestamp":1620128440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31623-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316227","9783642316234"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31623-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}