{"id":"https://openalex.org/W2018931121","doi":"https://doi.org/10.1142/s0129054105003431","title":"MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON","display_name":"MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON","publication_year":2005,"publication_date":"2005-10-01","ids":{"openalex":"https://openalex.org/W2018931121","doi":"https://doi.org/10.1142/s0129054105003431","mag":"2018931121"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003431","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003431","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5023816775","display_name":"Libor Pol\u00e1k","orcid":null},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"LIBOR POL\u00c1K","raw_affiliation_strings":["Department of Mathematics, Masaryk University, Jan\u00e1ckovo n\u00e1m. 2a, 662 95 Brno, Czech Republic","Department of Mathematics, Masaryk University,  Jan\u00e1ckovo n\u00e1m. 2a, 662 95 Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Masaryk University, Jan\u00e1ckovo n\u00e1m. 2a, 662 95 Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"Department of Mathematics, Masaryk University,  Jan\u00e1ckovo n\u00e1m. 2a, 662 95 Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023816775"],"corresponding_institution_ids":["https://openalex.org/I21449261"],"apc_list":null,"apc_paid":null,"fwci":3.1622,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.91133079,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"16","issue":"05","first_page":"999","last_page":"1010"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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":1.0,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9929999709129333,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9900000095367432,"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/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.7363311648368835},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.651382327079773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6096056699752808},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5696167349815369},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.5329911112785339},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5220851302146912},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.47884058952331543},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.426789790391922},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4216720461845398},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40077710151672363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.350510835647583},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30983006954193115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2802882790565491},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.27931448817253113},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.12159797549247742}],"concepts":[{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.7363311648368835},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.651382327079773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6096056699752808},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5696167349815369},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.5329911112785339},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5220851302146912},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.47884058952331543},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.426789790391922},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4216720461845398},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40077710151672363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.350510835647583},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30983006954193115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2802882790565491},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27931448817253113},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.12159797549247742}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054105003431","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003431","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1570949334","https://openalex.org/W2031848583","https://openalex.org/W2057427285","https://openalex.org/W2061668791","https://openalex.org/W4405645176"],"related_works":["https://openalex.org/W185868636","https://openalex.org/W2186499132","https://openalex.org/W2603910788","https://openalex.org/W2394954760","https://openalex.org/W2120954098","https://openalex.org/W1645283535","https://openalex.org/W4289920164","https://openalex.org/W2483992842","https://openalex.org/W1530258609","https://openalex.org/W3046613010"],"abstract_inverted_index":{"As":[0],"is":[1,12,86],"well":[2],"known,":[3],"each":[4],"minimal":[5],"NFA":[6,68],"for":[7,25],"a":[8,15,82],"regular":[9],"language":[10,57],"L":[11],"isomorphic":[13],"to":[14,44,88],"subautomaton":[16],"of":[17,35,37,50,61,67],"the":[18,45,55],"so-called":[19],"universal":[20],"automaton":[21],"[Formula:":[22,38,51],"see":[23,39,52],"text]":[24,40,53],"L.":[26,58],"We":[27,79],"explore":[28],"and":[29],"compare":[30],"various":[31],"conditions":[32],"on":[33,65],"sets":[34],"states":[36],"which":[41,85],"are":[42],"related":[43],"fact":[46],"that":[47,73],"induced":[48],"subautomata":[49],"accept":[54],"whole":[56],"The":[59],"methods":[60],"several":[62],"previous":[63],"works":[64],"minimalizations":[66],"can":[69],"be":[70],"modified":[71],"so":[72],"they":[74],"fit":[75],"in":[76],"our":[77],"approach.":[78],"also":[80],"propose":[81],"new":[83],"algorithm":[84],"easy":[87],"implement.":[89]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}