{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:45:19Z","timestamp":1782636319976,"version":"3.54.5"},"reference-count":12,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.446.6","type":"journal-article","created":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:24:52Z","timestamp":1782635092000},"page":"89-103","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Communicating Finite Automata: The Non-Forgetting Model"],"prefix":"10.4204","volume":"446","author":[{"given":"Jana","family":"Schulz","sequence":"first","affiliation":[{"name":"University of Potsdam"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2720","published-online":{"date-parts":[[2026,6,25]]},"reference":[{"issue":"07","key":"bordihnundecidability2011","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1142\/S0129054111008891","article-title":"Undecidability and Hierarchy Results for Parallel Communicating Finite Automata","volume":"22","author":"Bordihn","year":"2011","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"03","key":"bordihncomputational2012","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1142\/S0129054112500062","article-title":"On the Computational Capacity of Parallel Communicating Finite Automata","volume":"23","author":"Bordihn","year":"2012","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"08","key":"bordihnmeasuring2015","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1142\/S0129054115400146","article-title":"Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities","volume":"26","author":"Bordihn","year":"2015","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"choudharyreturning2007","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1051\/ita:2007014","article-title":"Returning and non-returning parallel communicating finite automata are equivalent","volume":"41","author":"Choudhary","year":"2007","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"key":"holzermulti-head2009","doi-asserted-by":"publisher","first-page":"93","DOI":"10.4204\/EPTCS.1.9","article-title":"Multi-Head Finite Automata: Characterizations, Concepts and Open Problems","volume-title":"International Workshop on The Complexity of Simple Programs","volume":"1","author":"Holzer","year":"2008"},{"key":"hopcroftintroduction1999","volume-title":"Introduction to automata theory, languages, and computation","author":"Hopcroft","year":"1979"},{"issue":"1","key":"ibarratwo-way1973","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/s0022-0000(73)80048-0","article-title":"On two-way multihead automata","volume":"7","author":"Ibarra","year":"1973","journal-title":"Journal of Computer and System Sciences"},{"issue":"05","key":"martin-videparallel2002","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1142\/S0129054102001424","article-title":"Parallel finite automata systems communicating by states","volume":"13","author":"Mart\u00edn-Vide","year":"2002","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"messerschmidthierarchy2011","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00224-009-9247-x","article-title":"A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata","volume":"48","author":"Messerschmidt","year":"2011","journal-title":"Theory of Computing Systems"},{"key":"moektopologies2024","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-031-66159-4_16","article-title":"Network Topologies for Parallel Communicating Finite Automata: Token-Ring and Token-Bus","volume-title":"Developments in Language Theory","author":"Moek","year":"2024"},{"key":"rozenberghandbook1997","doi-asserted-by":"publisher","volume-title":"Handbook of formal languages","year":"1997","DOI":"10.1007\/978-3-642-59136-5"},{"issue":"8","key":"xieparallel2025","doi-asserted-by":"publisher","DOI":"10.3390\/math13081265","article-title":"Parallel Communicating Finite Automata: Productiveness and Succinctness","volume":"13","author":"Xie","year":"2025","journal-title":"Mathematics"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:25:01Z","timestamp":1782635101000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2606.26684v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,25]]},"references-count":12,"URL":"https:\/\/doi.org\/10.4204\/eptcs.446.6","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,25]]}}}