{"id":"https://openalex.org/W7167072749","doi":"https://doi.org/10.48550/arxiv.2607.00742","title":"Algorithms and fine-grained complexity for nondeterministic and symmetric difference automata","display_name":"Algorithms and fine-grained complexity for nondeterministic and symmetric difference automata","publication_year":2026,"publication_date":"2026-07-01","ids":{"openalex":"https://openalex.org/W7167072749","doi":"https://doi.org/10.48550/arxiv.2607.00742"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.00742","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00742","pdf_url":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.00742","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123119033","display_name":"Dmitry Chistikov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chistikov, Dmitry","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045932502","display_name":"Rados\u0142aw Pi\u00f3rkowski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pi\u00f3rkowski, Rados\u0142aw","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088843055","display_name":"Neha Rino","orcid":"https://orcid.org/0009-0001-3273-1954"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rino, Neha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000026394","display_name":"Brink van der Merwe","orcid":"https://orcid.org/0000-0001-5010-9934"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van der Merwe, Brink","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.47929999232292175,"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/T10142","display_name":"Formal Methods in Verification","score":0.47929999232292175,"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/T11567","display_name":"semigroups and automata theory","score":0.42500001192092896,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.019999999552965164,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/automaton","display_name":"Automaton","score":0.6442000269889832},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6107000112533569},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.5223000049591064},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4722999930381775},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4699000120162964},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.46790000796318054},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4447999894618988},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4244999885559082},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.4124000072479248}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6442000269889832},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6107000112533569},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.588100016117096},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.5223000049591064},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5051000118255615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49729999899864197},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4722999930381775},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4699000120162964},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.46790000796318054},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4447999894618988},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4244999885559082},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.4124000072479248},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.38530001044273376},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.38260000944137573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36480000615119934},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.3343999981880188},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.3319999873638153},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32710000872612},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.29750001430511475},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.2777000069618225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26809999346733093},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.2646999955177307},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.26429998874664307},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.2619999945163727},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.2522999942302704},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.00742","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00742","pdf_url":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.00742","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00742","pdf_url":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7856587171554565}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Symmetric":[0],"difference":[1],"automata":[2,10,30,81,132],"(XNFA)":[3],"are":[4,28],"a":[5,71],"variant":[6],"of":[7,21,40,56,66,74,82,116,123,126],"standard":[8],"finite":[9],"in":[11,59,102],"which":[12],"an":[13],"input":[14],"word":[15],"is":[16,24],"accepted":[17],"iff":[18],"the":[19,32,37,41,54,57,64,103,114],"number":[20],"accepting":[22],"runs":[23],"odd.":[25],"Equivalently,":[26],"these":[27],"weighted":[29,131],"over":[31,133],"two-element":[33],"field.":[34],"We":[35],"study":[36],"fine-grained":[38],"complexity":[39],"basic":[42],"decision":[43],"problems":[44],"for":[45,92,113,119],"XNFA:":[46],"acceptance,":[47],"emptiness,":[48],"and":[49,95,121,136],"equivalence,":[50],"aiming":[51],"to":[52,77,130],"optimise":[53],"degree":[55],"polynomial":[58,67],"their":[60],"running-time":[61],"bounds.":[62],"Under":[63],"assumption":[65],"ambiguity,":[68],"we":[69,88,109],"provide":[70],"randomised":[72],"reduction":[73],"NFA":[75,94],"acceptance":[76,91],"XNFA":[78,96],"acceptance.":[79],"For":[80],"bounded":[83],"ambiguity":[84,107],"(e.g.,":[85],"unambiguous":[86],"automata),":[87],"show":[89],"that":[90],"both":[93],"can":[97],"be":[98],"decided":[99],"faster":[100,111],"than":[101],"general":[104],"case.":[105],"Without":[106],"assumptions,":[108],"give":[110],"algorithms":[112],"verification":[115],"suitable":[117],"certificates":[118],"(non)emptiness":[120],"(non)equivalence":[122],"XNFA.":[124],"Several":[125],"our":[127],"results":[128],"extend":[129],"other":[134],"semirings":[135],"fields.":[137]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}