{"id":"https://openalex.org/W7166308300","doi":"https://doi.org/10.4204/eptcs.446.6","title":"Parallel Communicating Finite Automata: The Non-Forgetting Model","display_name":"Parallel Communicating Finite Automata: The Non-Forgetting Model","publication_year":2026,"publication_date":"2026-06-25","ids":{"openalex":"https://openalex.org/W7166308300","doi":"https://doi.org/10.4204/eptcs.446.6"},"language":"en","primary_location":{"id":"doi:10.4204/eptcs.446.6","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.446.6","pdf_url":null,"source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.4204/eptcs.446.6","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134369092","display_name":"Jana Schulz","orcid":null},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jana Schulz","raw_affiliation_strings":["University of Potsdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Potsdam","institution_ids":["https://openalex.org/I176453806"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5134369092"],"corresponding_institution_ids":["https://openalex.org/I176453806"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67089956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"446","issue":null,"first_page":"89","last_page":"103"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.44670000672340393,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.44670000672340393,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.30979999899864197,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.03970000147819519,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7522000074386597},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6290000081062317},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6147000193595886},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.5889999866485596},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5507000088691711},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5440000295639038},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5351999998092651},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.454800009727478}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7522000074386597},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6290000081062317},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6147000193595886},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.5889999866485596},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5507000088691711},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5440000295639038},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5351999998092651},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.51419997215271},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49149999022483826},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.454800009727478},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4447999894618988},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.436599999666214},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.40070000290870667},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.37389999628067017},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.35839998722076416},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.3449999988079071},{"id":"https://openalex.org/C75745568","wikidata":"https://www.wikidata.org/wiki/Q5165519","display_name":"Continuous spatial automaton","level":5,"score":0.3443000018596649},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.33809998631477356},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3061000108718872},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.2700999975204468}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4204/eptcs.446.6","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.446.6","pdf_url":null,"source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2606.26684","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2606.26684","pdf_url":"https://arxiv.org/pdf/2606.26684","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.4204/eptcs.446.6","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.446.6","pdf_url":null,"source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7501025795936584,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Parallel":[0],"Communicating":[1],"Finite":[2],"Automata":[3],"(PCFA)":[4],"are":[5,58,87,151],"systems":[6,57,73,119],"of":[7,18,54,63,84,102,107,116,132],"several":[8,52],"finite":[9,76],"automata":[10,41,56,92,103],"that":[11,81,150],"can":[12],"communicate":[13],"by":[14],"requesting":[15],"the":[16,35,64,94,100,105,113,130,154],"state":[17],"another":[19],"automaton.":[20],"As":[21,48],"an":[22],"attempt":[23],"to":[24,71],"make":[25],"PCFA":[26,86],"as":[27,88,90],"defined":[28],"in":[29,49,93,120],"[8]":[30],"and":[31,69,74,96],"[2]":[32,138],"more":[33],"realistic,":[34],"non-forgetting":[36,65,85],"model":[37,66],"is":[38,67,79,112,127,139],"introduced":[39],"where":[40,99],"retain":[42],"their":[43],"own":[44],"states":[45],"while":[46],"querying.":[47],"previous":[50],"publications,":[51],"variants":[53,83],"these":[55],"considered.":[59],"The":[60,109],"computational":[61],"capacity":[62],"investigated":[68],"compared":[70],"''forgetting''":[72,156],"multi-head":[75,91],"automata.":[77],"It":[78],"shown":[80],"most":[82],"powerful":[89],"deterministic":[95,117],"nondeterministic":[97],"cases":[98],"number":[101,106],"equals":[104],"heads.":[108],"only":[110],"exception":[111],"special":[114],"case":[115],"centralized":[118],"non-returning":[121],"mode.":[122],"Here,":[123],"a":[124,135],"strict":[125],"inclusion":[126],"proved.":[128],"In":[129],"course":[131],"this":[133,143],"proving,":[134],"proof":[136],"from":[137],"completed.":[140],"With":[141],"that,":[142],"paper":[144],"answers":[145],"some":[146],"questions":[147],"for":[148,153],"nfPCFA":[149],"open":[152],"classical":[155],"case.":[157]},"counts_by_year":[],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2026-06-28T00:00:00"}