{"id":"https://openalex.org/W2179466082","doi":"https://doi.org/10.1007/11605157_3","title":"Minimization of Non-deterministic Automata with Large Alphabets","display_name":"Minimization of Non-deterministic Automata with Large Alphabets","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2179466082","doi":"https://doi.org/10.1007/11605157_3","mag":"2179466082"},"language":"en","primary_location":{"id":"doi:10.1007/11605157_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11605157_3","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002478680","display_name":"Parosh Aziz Abdulla","orcid":"https://orcid.org/0000-0001-6832-6611"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]},{"id":"https://openalex.org/I4210158519","display_name":"Informa (Sweden)","ror":"https://ror.org/04yt64d76","country_code":"SE","type":"company","lineage":["https://openalex.org/I4210154378","https://openalex.org/I4210158519"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Parosh Aziz Abdulla","raw_affiliation_strings":["Dept. of Information Technology, P.O.\u00a0Box 337, S-751 05, Uppsala, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, P.O.\u00a0Box 337, S-751 05, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033803768","display_name":"Johann Deneux","orcid":null},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]},{"id":"https://openalex.org/I4210158519","display_name":"Informa (Sweden)","ror":"https://ror.org/04yt64d76","country_code":"SE","type":"company","lineage":["https://openalex.org/I4210154378","https://openalex.org/I4210158519"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johann Deneux","raw_affiliation_strings":["Dept. of Information Technology, P.O.\u00a0Box 337, S-751 05, Uppsala, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, P.O.\u00a0Box 337, S-751 05, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031470842","display_name":"Lisa Kaati","orcid":"https://orcid.org/0000-0002-3724-7504"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]},{"id":"https://openalex.org/I4210158519","display_name":"Informa (Sweden)","ror":"https://ror.org/04yt64d76","country_code":"SE","type":"company","lineage":["https://openalex.org/I4210154378","https://openalex.org/I4210158519"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Lisa Kaati","raw_affiliation_strings":["Dept. of Information Technology, P.O.\u00a0Box 337, S-751 05, Uppsala, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, P.O.\u00a0Box 337, S-751 05, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004168442","display_name":"Marcus Nilsson","orcid":null},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]},{"id":"https://openalex.org/I4210158519","display_name":"Informa (Sweden)","ror":"https://ror.org/04yt64d76","country_code":"SE","type":"company","lineage":["https://openalex.org/I4210154378","https://openalex.org/I4210158519"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Marcus Nilsson","raw_affiliation_strings":["Dept. of Information Technology, P.O.\u00a0Box 337, S-751 05, Uppsala, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, P.O.\u00a0Box 337, S-751 05, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679","https://openalex.org/I4210158519"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2517,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.80353556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"31","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"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.9998000264167786,"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.9994000196456909,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9979000091552734,"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/binary-decision-diagram","display_name":"Binary decision diagram","score":0.7015808820724487},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6283398866653442},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5631970763206482},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.528731107711792},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5279825329780579},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5138893127441406},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.5028640627861023},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5027527809143066},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.4492744207382202},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4307031035423279},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42920437455177307},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.4236201047897339},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41138264536857605},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34723031520843506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3424755334854126},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.22626933455467224},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.22262176871299744}],"concepts":[{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.7015808820724487},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6283398866653442},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5631970763206482},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.528731107711792},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5279825329780579},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5138893127441406},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.5028640627861023},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5027527809143066},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.4492744207382202},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4307031035423279},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42920437455177307},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.4236201047897339},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41138264536857605},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34723031520843506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3424755334854126},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.22626933455467224},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.22262176871299744},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11605157_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11605157_3","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W189209848","https://openalex.org/W1497640022","https://openalex.org/W1499277573","https://openalex.org/W1504438699","https://openalex.org/W1507985299","https://openalex.org/W1508547921","https://openalex.org/W1517157359","https://openalex.org/W1523766116","https://openalex.org/W1553233117","https://openalex.org/W1593284044","https://openalex.org/W1762311305","https://openalex.org/W1971107784","https://openalex.org/W1973642705","https://openalex.org/W1994143452","https://openalex.org/W2005652416","https://openalex.org/W2021473546","https://openalex.org/W2045845366","https://openalex.org/W2068361557","https://openalex.org/W2071152819","https://openalex.org/W2080267935","https://openalex.org/W2122493035","https://openalex.org/W2124325155","https://openalex.org/W2164989576","https://openalex.org/W2167435507","https://openalex.org/W2561675875","https://openalex.org/W4237380200"],"related_works":["https://openalex.org/W1495872178","https://openalex.org/W1522712643","https://openalex.org/W2102135785","https://openalex.org/W2136070637","https://openalex.org/W2089212807","https://openalex.org/W2783071694","https://openalex.org/W1976268573","https://openalex.org/W2147441235","https://openalex.org/W2089409100","https://openalex.org/W3195897816"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}