{"id":"https://openalex.org/W35268004","doi":"https://doi.org/10.1007/978-3-642-38771-5_17","title":"Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata","display_name":"Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W35268004","doi":"https://doi.org/10.1007/978-3-642-38771-5_17","mag":"35268004"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-38771-5_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-38771-5_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00841848v1/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066625074","display_name":"Sven De Felice","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Sven De Felice","raw_affiliation_strings":["LIGM, Universit\u00e9 Paris-Est & CNRS, 77454, Marne-la-Vall\u00e9e Cedex 2, France"],"affiliations":[{"raw_affiliation_string":"LIGM, Universit\u00e9 Paris-Est & CNRS, 77454, Marne-la-Vall\u00e9e Cedex 2, France","institution_ids":["https://openalex.org/I4210152518","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042055476","display_name":"Cyril Nicaud","orcid":"https://orcid.org/0000-0002-8770-0119"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Cyril Nicaud","raw_affiliation_strings":["LIGM, Universit\u00e9 Paris-Est & CNRS, 77454, Marne-la-Vall\u00e9e Cedex 2, France"],"affiliations":[{"raw_affiliation_string":"LIGM, Universit\u00e9 Paris-Est & CNRS, 77454, Marne-la-Vall\u00e9e Cedex 2, France","institution_ids":["https://openalex.org/I4210152518","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066625074"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210152518"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.8593,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.90019763,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"179","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9983999729156494,"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/automaton","display_name":"Automaton","score":0.7580907344818115},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.7047137022018433},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5855134129524231},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.5461987853050232},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5241713523864746},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.5120890140533447},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4960533082485199},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.48187121748924255},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47846078872680664},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4612279236316681},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4330142140388489},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.39332062005996704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38954901695251465},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.3147256374359131},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26426175236701965},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.21995407342910767},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1376241147518158}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7580907344818115},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.7047137022018433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5855134129524231},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5461987853050232},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5241713523864746},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.5120890140533447},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4960533082485199},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.48187121748924255},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47846078872680664},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4612279236316681},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4330142140388489},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.39332062005996704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38954901695251465},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.3147256374359131},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26426175236701965},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.21995407342910767},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1376241147518158},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-38771-5_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-38771-5_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-00841848v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00841848","pdf_url":"https://hal.science/hal-00841848v1/document","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DLT'13, 2013, France. pp.179-190, &#x27E8;10.1007/978-3-642-38771-5_17&#x27E9;","raw_type":"Conference papers"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.396.1352","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.1352","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal-enpc.archives-ouvertes.fr/docs/00/84/18/48/PDF/Brzozowski_Algorithm_Is_Generically_Super-Polynomial_Deterministic_Automata.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00841848v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00841848","pdf_url":"https://hal.science/hal-00841848v1/document","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DLT'13, 2013, France. pp.179-190, &#x27E8;10.1007/978-3-642-38771-5_17&#x27E9;","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5549440890","display_name":null,"funder_award_id":"ANR-10-LAB","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5782898699","display_name":null,"funder_award_id":"ANR-10-LABX-58","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7240651115","display_name":null,"funder_award_id":"ANR-10","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"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W35268004.pdf","grobid_xml":"https://content.openalex.org/works/W35268004.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W186403072","https://openalex.org/W1493925387","https://openalex.org/W1515528048","https://openalex.org/W1519163652","https://openalex.org/W1588454361","https://openalex.org/W1606555018","https://openalex.org/W1672397475","https://openalex.org/W2013433986","https://openalex.org/W2062855758","https://openalex.org/W2070683796","https://openalex.org/W2074847588","https://openalex.org/W2088285637","https://openalex.org/W2122493035","https://openalex.org/W2154599653","https://openalex.org/W2226303357","https://openalex.org/W2340541605","https://openalex.org/W2369713881","https://openalex.org/W2492028220","https://openalex.org/W2502753018","https://openalex.org/W2963535203","https://openalex.org/W3134257814"],"related_works":["https://openalex.org/W185868636","https://openalex.org/W2037872771","https://openalex.org/W2136740376","https://openalex.org/W2169734852","https://openalex.org/W2462239665","https://openalex.org/W2171527505","https://openalex.org/W1987608226","https://openalex.org/W2047588061","https://openalex.org/W2124370744","https://openalex.org/W2950941115"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}
