{"id":"https://openalex.org/W4379924581","doi":"https://doi.org/10.4230/lipics.csl.2026.44","title":"Deciding minimal distinguishing DFAs is NP-complete","display_name":"Deciding minimal distinguishing DFAs is NP-complete","publication_year":2023,"publication_date":"2023-06-06","ids":{"openalex":"https://openalex.org/W4379924581","doi":"https://doi.org/10.4230/lipics.csl.2026.44"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2306.03533","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.03533","pdf_url":"https://arxiv.org/pdf/2306.03533","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2306.03533","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034035678","display_name":"Jan Martens","orcid":"https://orcid.org/0000-0003-4797-7735"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Martens, Jan","raw_affiliation_strings":["Leiden Institute of Advanced Computer Science, Leiden University, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-4797-7735","affiliations":[{"raw_affiliation_string":"Leiden Institute of Advanced Computer Science, Leiden University, The Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034035678"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11885953,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11567","display_name":"semigroups and automata theory","score":0.9927999973297119,"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.9927999973297119,"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.9921000003814697,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9782999753952026,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6989496946334839},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.6851890087127686},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6030089259147644},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5787141919136047},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5086846947669983},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5038520693778992},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4904801547527313},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.4520058035850525},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.44945022463798523},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4398646056652069},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42765605449676514},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.41269034147262573},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4031080901622772},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.375337690114975},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3726126551628113},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.13573572039604187}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6989496946334839},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.6851890087127686},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6030089259147644},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5787141919136047},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5086846947669983},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5038520693778992},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4904801547527313},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.4520058035850525},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.44945022463798523},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4398646056652069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42765605449676514},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.41269034147262573},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4031080901622772},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.375337690114975},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3726126551628113},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.13573572039604187},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:arXiv.org:2306.03533","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.03533","pdf_url":"https://arxiv.org/pdf/2306.03533","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25469","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2026.44","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol363-csl2026/LIPIcs.CSL.2026.44/LIPIcs.CSL.2026.44.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/5b073b8c-bcdd-43f9-a658-f899c7b7b9aa","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/5b073b8c-bcdd-43f9-a658-f899c7b7b9aa","pdf_url":"https://pure.tue.nl/ws/files/301422035/2306.03533v1.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Martens, J 2023 'Deciding minimal distinguishing DFAs is NP-complete' arXiv.org.","raw_type":"info:eu-repo/semantics/preprint"},{"id":"pmh:tue:oai:pure.tue.nl:publications/5b073b8c-bcdd-43f9-a658-f899c7b7b9aa","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/5b073b8c-bcdd-43f9-a658-f899c7b7b9aa","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"VOLUME=2306.03533;TITLE=None","raw_type":"info:eu-repo/semantics/other"},{"id":"doi:10.48550/arxiv.2306.03533","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2306.03533","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.csl.2026.44","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.csl.2026.44","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2306.03533","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.03533","pdf_url":"https://arxiv.org/pdf/2306.03533","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4379924581.pdf","grobid_xml":"https://content.openalex.org/works/W4379924581.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2810776027","https://openalex.org/W2136740376","https://openalex.org/W2037872771","https://openalex.org/W63685668","https://openalex.org/W1990283467","https://openalex.org/W1983100634","https://openalex.org/W2243509623","https://openalex.org/W2581079654","https://openalex.org/W2139519154","https://openalex.org/W1987608226"],"abstract_inverted_index":{"In":[0],"this":[1,52],"paper,":[2],"we":[3],"present":[4],"a":[5,34,38,57,70,74],"proof":[6],"of":[7,10,40,43,51,69,73],"the":[8,12,44,49,60,67],"NP-completeness":[9],"computing":[11],"smallest":[13],"Deterministic":[14],"Finite":[15],"Automaton":[16],"(DFA)":[17],"that":[18,32],"distinguishes":[19],"two":[20],"given":[21,45],"regular":[22],"languages":[23],"as":[24],"DFAs.":[25],"A":[26],"distinguishing":[27,71],"DFA":[28],"is":[29,37],"an":[30],"automaton":[31,72],"recognizes":[33],"language":[35],"which":[36],"subset":[39],"exactly":[41],"one":[42],"languages.":[46],"We":[47],"establish":[48],"NP-hardness":[50],"decision":[53],"problem":[54],"by":[55],"providing":[56],"reduction":[58],"from":[59],"Boolean":[61],"Satisfiability":[62],"Problem":[63],"(SAT)":[64],"to":[65],"deciding":[66],"existence":[68],"specific":[75],"size.":[76]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2023-06-09T00:00:00"}