{"id":"https://openalex.org/W2157341150","doi":"https://doi.org/10.1080/03057920412331272153","title":"Minimized Thompson NFA","display_name":"Minimized Thompson NFA","publication_year":2004,"publication_date":"2004-08-30","ids":{"openalex":"https://openalex.org/W2157341150","doi":"https://doi.org/10.1080/03057920412331272153","mag":"2157341150"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1080/03057920412331272153","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5019398706","display_name":"Guangming Xing","orcid":"https://orcid.org/0000-0002-1234-5247"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Guangming Xing","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5019398706"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":9,"citation_normalized_percentile":{"value":0.673294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":80,"max":81},"biblio":{"volume":"81","issue":"9","first_page":"1097","last_page":"1106"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9999,"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.9999,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9986,"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/T12029","display_name":"DNA and Biological Computing","score":0.99,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.7904798},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6594544},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.6376116},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46110493}],"concepts":[{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.7904798},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6594544},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.6376116},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6231738},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.5489231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5227021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.517463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48659098},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46110493},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.43539226},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3160814},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20183936},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1734637},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12597701}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1080/03057920412331272153","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":14,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1768003599","https://openalex.org/W2013120826","https://openalex.org/W2072607050","https://openalex.org/W2077450865","https://openalex.org/W2092860912","https://openalex.org/W2094985106","https://openalex.org/W2099540492","https://openalex.org/W2105986919","https://openalex.org/W2129414328","https://openalex.org/W2136238707","https://openalex.org/W2157211828","https://openalex.org/W2586374872","https://openalex.org/W3150132563"],"related_works":["https://openalex.org/W4249650827","https://openalex.org/W3143588635","https://openalex.org/W3136824659","https://openalex.org/W3094387502","https://openalex.org/W2115419634","https://openalex.org/W2090734721","https://openalex.org/W2089404966","https://openalex.org/W2089302579","https://openalex.org/W2060032524","https://openalex.org/W1990473086"],"abstract_inverted_index":{"The":[0,116],"problem":[1,15],"of":[2,113,132],"converting":[3],"a":[4,13,40,48,59],"regular":[5,60,134],"expression":[6,61],"to":[7,129],"nondeterministic":[8],"finite":[9],"automaton":[10],"(NFA)":[11],"is":[12,44,91,97],"fundamental":[14],"that":[16,70,93,101],"has":[17],"been":[18],"well":[19],"studied.":[20],"However,":[21],"the":[22,73,94,110,122,130,133],"two":[23],"basic":[24],"construction":[25],"algorithms:":[26],"(1)":[27],"Thompson,":[28],"(2)":[29],"McNaughton\u2013Yamada":[30],"and":[31,118],"Glushkov,":[32],"both":[33],"have":[34],"disadvantages.":[35],"In":[36],"this":[37],"article:":[38],"first,":[39],"\u2018smart\u2019":[41],"parsing":[42],"algorithm":[43,69],"developed":[45],"which":[46],"constructs":[47],"parse":[49],"tree":[50],"with":[51,62,127],"at":[52],"most":[53],"(3l":[54],"\u2212":[55],"1)":[56],"nodes":[57],"form":[58],"l":[63],"literals;":[64],"second,":[65],"we":[66],"propose":[67],"an":[68],"works":[71],"on":[72],"resulting":[74,95],"NFA":[75,96],"from":[76],"Thompson's":[77,88],"construction,":[78],"eliminating":[79],"as":[80,84],"many":[81],"auxiliary":[82,103],"states":[83,104],"possible":[85],"while":[86],"maintaining":[87],"properties.":[89],"It":[90],"shown":[92],"minimized.":[98],"This":[99],"means":[100],"no":[102],"can":[105],"be":[106],"eliminated":[107],"without":[108],"violating":[109],"defining":[111],"properties":[112],"Thompson":[114],"NFA.":[115],"time":[117],"space":[119],"requirements":[120],"for":[121],"above":[123],"algorithms":[124],"are":[125],"linear":[126],"respect":[128],"length":[131],"expression.":[135]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2157341150","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2024-12-10T22:03:27.214920","created_date":"2016-06-24"}