{"id":"https://openalex.org/W2963141441","doi":"https://doi.org/10.23638/lmcs-16(1:14)2020","title":"Minimization of visibly pushdown automata is NP-complete","display_name":"Minimization of visibly pushdown automata is NP-complete","publication_year":2020,"publication_date":"2020-02-13","ids":{"openalex":"https://openalex.org/W2963141441","doi":"https://doi.org/10.23638/lmcs-16(1:14)2020","mag":"2963141441"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-16(1:14)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(1:14)2020","pdf_url":"https://lmcs.episciences.org/6099/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/6099/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032764050","display_name":"Olivier Gauwin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Olivier Gauwin","raw_affiliation_strings":["Laboratoire Bordelais de Recherche en Informatique"],"affiliations":[{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044780614","display_name":"Anca Muscholl","orcid":"https://orcid.org/0000-0002-8214-204X"},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Anca Muscholl","raw_affiliation_strings":["Laboratoire Bordelais de Recherche en Informatique"],"affiliations":[{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008915624","display_name":"Mikhail Raskin","orcid":"https://orcid.org/0000-0002-6660-5673"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Raskin","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032764050"],"corresponding_institution_ids":["https://openalex.org/I4210142254"],"apc_list":null,"apc_paid":null,"fwci":0.0835,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.42311649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"Volume 16, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.4422999918460846,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.4422999918460846,"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/T11567","display_name":"semigroups and automata theory","score":0.4025000035762787,"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/T10142","display_name":"Formal Methods in Verification","score":0.06909999996423721,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.8177791833877563},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7976248264312744},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.6948614120483398},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.6278772354125977},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.548783540725708},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4851318299770355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.344860702753067},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2648499608039856},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2468213438987732},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.13389447331428528},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.08861130475997925},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.06576231122016907},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.061562806367874146},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.05593225359916687}],"concepts":[{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.8177791833877563},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7976248264312744},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.6948614120483398},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.6278772354125977},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.548783540725708},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4851318299770355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.344860702753067},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2648499608039856},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2468213438987732},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.13389447331428528},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.08861130475997925},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.06576231122016907},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.061562806367874146},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.05593225359916687}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.23638/lmcs-16(1:14)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(1:14)2020","pdf_url":"https://lmcs.episciences.org/6099/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1907.09563","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.09563","pdf_url":"https://arxiv.org/pdf/1907.09563","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.23638/lmcs-16(1:14)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(1:14)2020","pdf_url":"https://lmcs.episciences.org/6099/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G794676242","display_name":null,"funder_award_id":"ANR-16-CE40-0007","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320323712","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2963141441.pdf"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W31912597","https://openalex.org/W1516541943","https://openalex.org/W1964127120","https://openalex.org/W2011039300","https://openalex.org/W2032759707","https://openalex.org/W2137370934","https://openalex.org/W2142746286","https://openalex.org/W2151033407","https://openalex.org/W2157017998","https://openalex.org/W2582132278"],"related_works":["https://openalex.org/W1991406344","https://openalex.org/W2012479020","https://openalex.org/W1972232894","https://openalex.org/W2067895928","https://openalex.org/W2074593591","https://openalex.org/W392685101","https://openalex.org/W2177744885","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W4241567000"],"abstract_inverted_index":{"We":[0,49],"show":[1,50],"that":[2,18,34,51],"the":[3,61],"minimization":[4,62],"of":[5,46,63],"visibly":[6,64],"pushdown":[7,65],"automata":[8],"is":[9,13,37,54],"NP-complete.":[10],"This":[11],"result":[12],"obtained":[14],"by":[15],"introducing":[16],"immersions,":[17],"recognize":[19],"multiple":[20],"languages":[21],"(over":[22],"a":[23,28,44],"usual,":[24],"non-visible":[25],"alphabet)":[26],"using":[27],"common":[29],"deterministic":[30],"transition":[31],"graph,":[32],"such":[33],"each":[35],"language":[36],"associated":[38],"with":[39],"an":[40],"initial":[41],"state":[42],"and":[43,56],"set":[45],"final":[47],"states.":[48],"minimizing":[52],"immersions":[53],"NP-complete,":[55],"reduce":[57],"this":[58],"problem":[59],"to":[60],"automata.":[66]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-21T08:13:44.787528","created_date":"2025-10-10T00:00:00"}