{"id":"https://openalex.org/W3032490305","doi":"https://doi.org/10.1007/978-3-030-48516-0_6","title":"On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection","display_name":"On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3032490305","doi":"https://doi.org/10.1007/978-3-030-48516-0_6","mag":"3032490305"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-48516-0_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-48516-0_6","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://www.ncbi.nlm.nih.gov/pmc/articles/7247879","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074187313","display_name":"Mateus de Oliveira Oliveira","orcid":"https://orcid.org/0000-0001-7798-7446"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Mateus de Oliveira Oliveira","raw_affiliation_strings":["University of Bergen, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056314718","display_name":"Michael Wehar","orcid":"https://orcid.org/0009-0007-9251-7128"},"institutions":[{"id":"https://openalex.org/I118020396","display_name":"Swarthmore College","ror":"https://ror.org/012dg8a96","country_code":"US","type":"education","lineage":["https://openalex.org/I118020396"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Wehar","raw_affiliation_strings":["Swarthmore College, Swarthmore, PA, USA"],"affiliations":[{"raw_affiliation_string":"Swarthmore College, Swarthmore, PA, USA","institution_ids":["https://openalex.org/I118020396"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056314718"],"corresponding_institution_ids":["https://openalex.org/I118020396"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.4117,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.88161868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"69","last_page":"82"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994999766349792,"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.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7213084101676941},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.692649245262146},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.629909098148346},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6234791874885559},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.578477680683136},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5766737461090088},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5232062339782715},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.4994063377380371},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4419712424278259},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.43074166774749756},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4249735474586487},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.39317089319229126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3583642244338989},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.29813504219055176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2834671139717102},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16334232687950134}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7213084101676941},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.692649245262146},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.629909098148346},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6234791874885559},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.578477680683136},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5766737461090088},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5232062339782715},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.4994063377380371},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4419712424278259},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.43074166774749756},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4249735474586487},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.39317089319229126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3583642244338989},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.29813504219055176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2834671139717102},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16334232687950134},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-48516-0_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-48516-0_6","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:pubmedcentral.nih.gov:7247879","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/7247879","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Developments in Language Theory","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:pubmedcentral.nih.gov:7247879","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/7247879","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Developments in Language Theory","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W115737229","https://openalex.org/W184142732","https://openalex.org/W1486877437","https://openalex.org/W1547995103","https://openalex.org/W1576180980","https://openalex.org/W1979381272","https://openalex.org/W1985572324","https://openalex.org/W1995502606","https://openalex.org/W1995725694","https://openalex.org/W2002992445","https://openalex.org/W2004130530","https://openalex.org/W2009147258","https://openalex.org/W2010217280","https://openalex.org/W2012948111","https://openalex.org/W2021372200","https://openalex.org/W2039529128","https://openalex.org/W2055693471","https://openalex.org/W2060270693","https://openalex.org/W2087638517","https://openalex.org/W2088141885","https://openalex.org/W2106793914","https://openalex.org/W2119582939","https://openalex.org/W2130190334","https://openalex.org/W2146507303","https://openalex.org/W2147611860","https://openalex.org/W2162561603","https://openalex.org/W2167815360","https://openalex.org/W2178011018","https://openalex.org/W2256089709","https://openalex.org/W2297482369","https://openalex.org/W2586499659","https://openalex.org/W2885558565","https://openalex.org/W4214889528","https://openalex.org/W4256418102","https://openalex.org/W4285719527","https://openalex.org/W4388289494"],"related_works":["https://openalex.org/W4390119107","https://openalex.org/W4226247106","https://openalex.org/W2033042995","https://openalex.org/W2173621488","https://openalex.org/W2017609259","https://openalex.org/W1486286946","https://openalex.org/W1981385397","https://openalex.org/W1980879781","https://openalex.org/W2122747219","https://openalex.org/W2080505327"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}