{"id":"https://openalex.org/W1969561112","doi":"https://doi.org/10.1016/j.ipl.2012.04.010","title":"Efficient inclusion testing for simple classes of unambiguous \u03c9-automata","display_name":"Efficient inclusion testing for simple classes of unambiguous \u03c9-automata","publication_year":2012,"publication_date":"2012-05-02","ids":{"openalex":"https://openalex.org/W1969561112","doi":"https://doi.org/10.1016/j.ipl.2012.04.010","mag":"1969561112"},"language":"en","primary_location":{"id":"doi:10.1016/j.ipl.2012.04.010","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ipl.2012.04.010","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051182271","display_name":"Dimitri Isaak","orcid":null},"institutions":[{"id":"https://openalex.org/I4210126395","display_name":"Inform (Germany)","ror":"https://ror.org/02x8c2t37","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210126395"]},{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dimitri Isaak","raw_affiliation_strings":["Informatik 7, RWTH Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Informatik 7, RWTH Aachen, Germany","institution_ids":["https://openalex.org/I4210126395","https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021229064","display_name":"Christof L\u00f6ding","orcid":"https://orcid.org/0000-0002-1529-2806"},"institutions":[{"id":"https://openalex.org/I4210126395","display_name":"Inform (Germany)","ror":"https://ror.org/02x8c2t37","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210126395"]},{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christof L\u00f6ding","raw_affiliation_strings":["Informatik 7, RWTH Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Informatik 7, RWTH Aachen, Germany","institution_ids":["https://openalex.org/I4210126395","https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021229064"],"corresponding_institution_ids":["https://openalex.org/I4210126395","https://openalex.org/I887968799"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":0.922,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.81214509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"112","issue":"14-15","first_page":"578","last_page":"582"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9871000051498413,"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/reachability","display_name":"Reachability","score":0.7944692373275757},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.780455470085144},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.696779191493988},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6204915642738342},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.5933324694633484},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.593094527721405},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.5789362192153931},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5492203831672668},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5383585095405579},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5066371560096741},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.47492533922195435},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4651537835597992},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.45915523171424866},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4569852650165558},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.45171502232551575},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4118889570236206},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3964003622531891},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33555877208709717},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32327038049697876}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7944692373275757},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.780455470085144},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.696779191493988},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6204915642738342},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.5933324694633484},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.593094527721405},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.5789362192153931},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5492203831672668},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5383585095405579},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5066371560096741},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.47492533922195435},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4651537835597992},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.45915523171424866},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4569852650165558},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.45171502232551575},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4118889570236206},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3964003622531891},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33555877208709717},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32327038049697876},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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":1,"locations":[{"id":"doi:10.1016/j.ipl.2012.04.010","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ipl.2012.04.010","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.800000011920929,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1533605922","https://openalex.org/W1655990431","https://openalex.org/W1964626357","https://openalex.org/W2019789808","https://openalex.org/W2059200976","https://openalex.org/W2091227187","https://openalex.org/W2111715088","https://openalex.org/W2129828874","https://openalex.org/W6631871426"],"related_works":["https://openalex.org/W2155870982","https://openalex.org/W2408583837","https://openalex.org/W2404099564","https://openalex.org/W2091988401","https://openalex.org/W2042728676","https://openalex.org/W3133748972","https://openalex.org/W1482505495","https://openalex.org/W2902125852","https://openalex.org/W1990283467","https://openalex.org/W2899631209"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}