{"id":"https://openalex.org/W2395720161","doi":"https://doi.org/10.3233/fi-2016-1435","title":"On the Computational Complexity of Partial Word Automata Problems","display_name":"On the Computational Complexity of Partial Word Automata Problems","publication_year":2016,"publication_date":"2016-12-24","ids":{"openalex":"https://openalex.org/W2395720161","doi":"https://doi.org/10.3233/fi-2016-1435","mag":"2395720161"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2016-1435","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1435","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.22029/jlupub-6966","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016664760","display_name":"Markus Holzer","orcid":"https://orcid.org/0000-0003-4224-4014"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Markus Holzer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany. {holzer,sebastian.jakobi,matthias.wendlandt}@informatik.uni-giessen.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany. {holzer,sebastian.jakobi,matthias.wendlandt}@informatik.uni-giessen.de","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051371872","display_name":"Sebastian Jakobi","orcid":null},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Jakobi","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany. {holzer,sebastian.jakobi,matthias.wendlandt}@informatik.uni-giessen.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany. {holzer,sebastian.jakobi,matthias.wendlandt}@informatik.uni-giessen.de","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083635884","display_name":"Matthias Wendlandt","orcid":"https://orcid.org/0009-0001-2243-549X"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"University of Giessen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Wendlandt","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany. {holzer,sebastian.jakobi,matthias.wendlandt}@informatik.uni-giessen.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany. {holzer,sebastian.jakobi,matthias.wendlandt}@informatik.uni-giessen.de","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016664760"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.05038271,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"148","issue":"3-4","first_page":"267","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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.9997000098228455,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9911999702453613,"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/word","display_name":"Word (group theory)","score":0.5865676999092102},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5394381880760193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5195175409317017},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5061189532279968},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.49214547872543335},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.48367223143577576},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4758826792240143},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4461734890937805},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.44252005219459534},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4355071187019348},{"id":"https://openalex.org/keywords/universality","display_name":"Universality (dynamical systems)","score":0.42218518257141113},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.40105128288269043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3684864640235901},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32013678550720215},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2365381121635437},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22033607959747314}],"concepts":[{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5865676999092102},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5394381880760193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5195175409317017},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5061189532279968},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.49214547872543335},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.48367223143577576},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4758826792240143},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4461734890937805},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.44252005219459534},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4355071187019348},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.42218518257141113},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.40105128288269043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3684864640235901},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32013678550720215},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2365381121635437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22033607959747314},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3233/fi-2016-1435","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2016-1435","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},{"id":"pmh:oai:geb.uni-giessen.de:11058","is_oa":false,"landing_page_url":"http://geb.uni-giessen.de/geb/volltexte/2014/11058/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401439","display_name":"University writing server of the Justus Liebig University Giessen (Justus-Liebig-Universit\u00e4t Gie\u00dfen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200763008","host_organization_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","host_organization_lineage":["https://openalex.org/I200763008"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:workingPaper"},{"id":"doi:10.22029/jlupub-6966","is_oa":true,"landing_page_url":"https://doi.org/10.22029/jlupub-6966","pdf_url":null,"source":{"id":"https://openalex.org/S7407052994","display_name":"Universit\u00e4tsbibliothek Gie\u00dfen","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"report"},{"id":"mag:2395720161","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/ncma/ncma2014.html#HolzerJW14","pdf_url":null,"source":{"id":"https://openalex.org/S4306520647","display_name":"NCMA","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":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"NCMA","raw_type":null}],"best_oa_location":{"id":"doi:10.22029/jlupub-6966","is_oa":true,"landing_page_url":"https://doi.org/10.22029/jlupub-6966","pdf_url":null,"source":{"id":"https://openalex.org/S7407052994","display_name":"Universit\u00e4tsbibliothek Gie\u00dfen","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"report"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2563201274","https://openalex.org/W2608771265","https://openalex.org/W2798896350","https://openalex.org/W2076095858","https://openalex.org/W2751846635","https://openalex.org/W2031613223","https://openalex.org/W2543139652","https://openalex.org/W3202622153","https://openalex.org/W2028755743","https://openalex.org/W2519230465","https://openalex.org/W3175373088","https://openalex.org/W2897518291","https://openalex.org/W2057914679","https://openalex.org/W848087444","https://openalex.org/W1498105629","https://openalex.org/W2414546088","https://openalex.org/W2053440968","https://openalex.org/W1608753191","https://openalex.org/W3038130870","https://openalex.org/W1826276606"],"abstract_inverted_index":{"We":[0,94],"consider":[1],"the":[2,41,45,76,79,97,137,141,151,154,169],"computational":[3],"complexity":[4,77,100],"of":[5,78,153],"problems":[6,115,135,156],"related":[7,116],"to":[8,91,117,161],"partial":[9,15,28,38,56,85,118],"word":[10,16,19,29,39,57,86,119],"automata.":[11],"Roughly":[12],"speaking,":[13],"a":[14,18,27,32,37,51,70],"is":[17,31,89],"in":[20,44,165],"which":[21,88],"some":[22],"positions":[23,43],"are":[24,48,127],"unspecified":[25,42],"and":[26,125,163],"automaton":[30,34],"finite":[33,146],"that":[35,112,140],"accepts":[36],"language\u2014here":[40],"wor":[46],"d":[47],"represented":[49],"by":[50,68,104],"\u201chole\u201d":[52],"symbol":[53],"\u22c4.":[54],"A":[55],"language":[58,66],"L\u2032":[59],"can":[60],"be":[61,92],"transformed":[62],"into":[63],"an":[64],"ordinary":[65],"L":[67],"using":[69],"\u22c4-substitution.":[71],"In":[72,107,148],"particular,":[73],"we":[74,131],"investigate":[75],"compression":[80],"or":[81],"minimization":[82],"problem":[83,170],"for":[84],"automata,":[87,120],"known":[90,99],"NP-hard.":[93],"improve":[95],"on":[96,101,168],"previously":[98],"this":[102,149],"problem,":[103],"showing":[105],"PSPACE-completeness.":[106],"fact,":[108],"it":[109],"turns":[110],"out":[111],"almost":[113],"all":[114],"such":[121],"as,":[122],"e.g.,":[123],"equivalence":[124],"universality,":[126],"already":[128],"PSPACE-complete.":[129],"Moreover,":[130],"also":[132],"study":[133],"these":[134],"under":[136],"further":[138],"restriction":[139],"involved":[142],"automata":[143],"accept":[144],"only":[145],"languages.":[147],"case,":[150],"complexities":[152],"studied":[155],"drop":[157],"from":[158],"PSPACE-completeness":[159],"down":[160],"coNP-hardness":[162],"containment":[164],"\u22112P":[166],"depending":[167],"investigated.":[171]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}