{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:24:40Z","timestamp":1743081880656,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_11","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"146-157","source":"Crossref","is-referenced-by-count":3,"title":["On the Computational Capacity of Parallel Communicating Finite Automata"],"prefix":"10.1007","author":[{"given":"Henning","family":"Bordihn","sequence":"first","affiliation":[]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM\u00a030, 323\u2013342 (1983)","journal-title":"J. ACM"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0020-0190(87)90172-4","volume":"25","author":"A. Buda","year":"1987","unstructured":"Buda, A.: Multiprocessor automata. Inform. Process. Lett.\u00a025, 257\u2013261 (1987)","journal-title":"Inform. Process. Lett."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1051\/ita:2007014","volume":"41","author":"A. Choudhary","year":"2007","unstructured":"Choudhary, A., Krithivasan, K., Mitrana, V.: Returning and non-returning parallel communicating finite automata are equivalent. RAIRO Inform. Th\u00e9or.\u00a041, 137\u2013145 (2007)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"11_CR4","unstructured":"Csuhaj-Varj\u00fa, E., Dassow, J., Kelemen, J., P\u0103un, G.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, Yverdon (1994)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1007\/BFb0055111","volume-title":"Automata, Languages and Programming","author":"P. \u010euri\u0161","year":"1998","unstructured":"\u010euri\u0161, P., Jurdzi\u0144ski, T., Kuty\u0142owski, M., Lory\u015b, K.: Power of cooperation and multihead finite systems. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 896\u2013907. Springer, Heidelberg (1998)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/S0019-9958(68)90901-7","volume":"13","author":"M.A. Harrison","year":"1968","unstructured":"Harrison, M.A., Ibarra, O.H.: Multi-tape and multi-head pushdown automata. Inform. Control\u00a013, 433\u2013470 (1968)","journal-title":"Inform. Control"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0022-0000(73)80048-0","volume":"7","author":"O.H. Ibarra","year":"1973","unstructured":"Ibarra, O.H.: On two-way multihead automata. J. Comput. System Sci.\u00a07, 28\u201336 (1973)","journal-title":"J. Comput. System Sci."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0190(74)90043-X","volume":"3","author":"O.H. Ibarra","year":"1974","unstructured":"Ibarra, O.H.: A note on semilinear sets and bounded-reversal multihead pushdown automata. Inform. Process. Lett.\u00a03, 25\u201328 (1974)","journal-title":"Inform. Process. Lett."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/11779148_23","volume-title":"Developments in Language Theory","author":"T. Jurdzi\u0144ski","year":"2006","unstructured":"Jurdzi\u0144ski, T.: The Boolean closure of growing context-sensitive languages. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 248\u2013259. Springer, Heidelberg (2006)"},{"key":"11_CR10","unstructured":"Klemm, R.: Systems of communicating finite state machines as a distributed alternative to finite state machines. Phd thesis, Pennsylvania State University (1996)"},{"key":"11_CR11","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":"11_CR12","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/42282.42284","volume":"35","author":"R. McNaughton","year":"1988","unstructured":"McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. ACM\u00a035, 324\u2013344 (1988)","journal-title":"J. ACM"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1147\/rd.105.0388","volume":"10","author":"A.L. Rosenberg","year":"1966","unstructured":"Rosenberg, A.L.: On multi-head finite automata. IBM J. Res. Dev.\u00a010, 388\u2013394 (1966)","journal-title":"IBM J. Res. Dev."},{"key":"11_CR14","volume-title":"Computational Complexity","author":"K. Wagner","year":"1986","unstructured":"Wagner, K., Wechsung, G.: Computational Complexity. Reidel, Dordrecht (1986)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/322063.322076","volume":"25","author":"A.C. Yao","year":"1978","unstructured":"Yao, A.C., Rivest, R.L.: k\u2009+\u20091 heads are better than k. J. ACM\u00a025, 337\u2013340 (1978)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:23:16Z","timestamp":1676679796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}