{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:44:29Z","timestamp":1742960669479,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031661587"},{"type":"electronic","value":"9783031661594"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-66159-4_16","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"218-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Network Topologies for\u00a0Parallel Communicating Finite Automata: Token-Ring and\u00a0Token-Bus"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-4709-9384","authenticated-orcid":false,"given":"Philomena","family":"Moek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-85780-8_11","volume-title":"Developments in Language Theory","author":"H Bordihn","year":"2008","unstructured":"Bordihn, H., Kutrib, M., Malcher, A.: On the computational capacity of parallel communicating finite automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 146\u2013157. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85780-8_11"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-14455-4_10","volume-title":"Developments in Language Theory","author":"H Bordihn","year":"2010","unstructured":"Bordihn, H., Kutrib, M., Malcher, A.: Undecidability and hierarchy results for parallel communicating finite automata. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 88\u201399. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14455-4_10"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Bordihn, H., Kutrib, M., Malcher, A.: Measuring communication in parallel communicating finite automata. Electron. Proc. Theor. Comput. Sci. 151 (2014). https:\/\/doi.org\/10.4204\/EPTCS.151.8","DOI":"10.4204\/EPTCS.151.8"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1142\/S0129054115400146","volume":"26","author":"H Bordihn","year":"2015","unstructured":"Bordihn, H., Kutrib, M., Malcher, A.: Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities. Int. J. Found. Comput. Sci. 26, 1101\u20131126 (2015). https:\/\/doi.org\/10.1142\/S0129054115400146","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00236-021-00396-9","volume":"58","author":"H Bordihn","year":"2021","unstructured":"Bordihn, H., Vaszil, G.: Reversible parallel communicating finite automata systems. Acta Inf. 58(4), 263\u2013279 (2021). https:\/\/doi.org\/10.1007\/s00236-021-00396-9","journal-title":"Acta Inf."},{"issue":"2","key":"16_CR6","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 30(2), 323\u2013342 (1983). https:\/\/doi.org\/10.1145\/322374.322380","journal-title":"J. ACM"},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0020-0190(87)90172-4","volume":"25","author":"AO Buda","year":"1987","unstructured":"Buda, A.O.: Multiprocessor automata. Inf. Process. Lett. 25(4), 257\u2013261 (1987). https:\/\/doi.org\/10.1016\/0020-0190(87)90172-4","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"16_CR8","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/S0019-9958(68)90901-7","volume":"13","author":"MA Harrison","year":"1968","unstructured":"Harrison, M.A., Ibarra, O.H.: Multi-tape and multi-head pushdown automata. Inf. Control 13(5), 433\u2013470 (1968). https:\/\/doi.org\/10.1016\/S0019-9958(68)90901-7","journal-title":"Inf. Control"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/S0022-0000(73)80048-0","volume":"7","author":"OH Ibarra","year":"1973","unstructured":"Ibarra, O.H.: On two-way multihead automata. J. Comput. Syst. Sci. 7(1), 28\u201336 (1973). https:\/\/doi.org\/10.1016\/S0022-0000(73)80048-0","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"IEEE standard for information processing systems \u2013 local area networks \u2013 part 4: standard for token-passing bus access method and physical layer specifications (1990). https:\/\/doi.org\/10.1109\/IEEESTD.1990.7229456","DOI":"10.1109\/IEEESTD.1990.7229456"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"IEEE information technology - telecommunications and information exchange between systems - local and metropolitan area networks - part 5: token ring access method and physical layer specifications (1998). https:\/\/doi.org\/10.1109\/IEEESTD.1998.8941590","DOI":"10.1109\/IEEESTD.1998.8941590"},{"issue":"05","key":"16_CR12","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. 13(05), 733\u2013749 (2002). https:\/\/doi.org\/10.1142\/S0129054102001424","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"16_CR13","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 35(2), 324\u2013344 (1988). https:\/\/doi.org\/10.1145\/42282.42284","journal-title":"J. ACM"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Rosenberg, A.L.: On multi-head finite automata. In: 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965), pp. 221\u2013228 (1965). https:\/\/doi.org\/10.1109\/FOCS.1965.19","DOI":"10.1109\/FOCS.1965.19"},{"key":"16_CR15","unstructured":"Wagner, K., Wechsung, G.: Computational Complexity. Mathematics and Its Applications. Springer (1986). https:\/\/books.google.de\/books?id=KLF7LMzr3moC"}],"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-031-66159-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T08:03:40Z","timestamp":1729325020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}