{"id":"https://openalex.org/W2160667301","doi":"https://doi.org/10.1093/comjnl/bxu049","title":"An Improved Algorithm for the Metamorphosis of Semi-Extended Regular Expressions to Deterministic Finite Automata","display_name":"An Improved Algorithm for the Metamorphosis of Semi-Extended Regular Expressions to Deterministic Finite Automata","publication_year":2014,"publication_date":"2014-06-22","ids":{"openalex":"https://openalex.org/W2160667301","doi":"https://doi.org/10.1093/comjnl/bxu049","mag":"2160667301"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxu049","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxu049","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","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/A5044368674","display_name":"Ajay Kumar","orcid":"https://orcid.org/0000-0002-4452-4725"},"institutions":[{"id":"https://openalex.org/I162030827","display_name":"Thapar Institute of Engineering & Technology","ror":"https://ror.org/00wdq3744","country_code":"IN","type":"education","lineage":["https://openalex.org/I162030827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"A. Kumar","raw_affiliation_strings":["Department of Computer Science and Engineering, Thapar University, Patiala 147004, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Thapar University, Patiala 147004, India","institution_ids":["https://openalex.org/I162030827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028581691","display_name":"Anil Kumar Verma","orcid":"https://orcid.org/0000-0002-7167-4323"},"institutions":[{"id":"https://openalex.org/I162030827","display_name":"Thapar Institute of Engineering & Technology","ror":"https://ror.org/00wdq3744","country_code":"IN","type":"education","lineage":["https://openalex.org/I162030827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A. K. Verma","raw_affiliation_strings":["Department of Computer Science and Engineering, Thapar University, Patiala 147004, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Thapar University, Patiala 147004, India","institution_ids":["https://openalex.org/I162030827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044368674"],"corresponding_institution_ids":["https://openalex.org/I162030827"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":0.7147,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7413651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"58","issue":"3","first_page":"448","last_page":"456"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9944000244140625,"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.9944000244140625,"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.9708999991416931,"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.9550999999046326,"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/concatenation","display_name":"Concatenation (mathematics)","score":0.8922597169876099},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.8730928301811218},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6712312698364258},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6456550359725952},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5972626805305481},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5599850416183472},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.558976411819458},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5589073300361633},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5246986150741577},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.4654693603515625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46100351214408875},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.449246346950531},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4326087236404419},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4073958098888397},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3068886399269104},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.21194547414779663},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18909090757369995}],"concepts":[{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.8922597169876099},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.8730928301811218},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6712312698364258},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6456550359725952},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5972626805305481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5599850416183472},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.558976411819458},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5589073300361633},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5246986150741577},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.4654693603515625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46100351214408875},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.449246346950531},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4326087236404419},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4073958098888397},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3068886399269104},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.21194547414779663},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18909090757369995},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/comjnl/bxu049","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxu049","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.844.1629","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.844.1629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://comjnl.oxfordjournals.org/content/58/3/448.full.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3143588635","https://openalex.org/W2160879187","https://openalex.org/W2115419634","https://openalex.org/W1560450186","https://openalex.org/W2136740376","https://openalex.org/W2083002627","https://openalex.org/W3146038687","https://openalex.org/W2394954760","https://openalex.org/W1644613146","https://openalex.org/W2113629662"],"abstract_inverted_index":{"Semi-extended":[0],"regular":[1,4,24,44],"expressions":[2,5,25],"are":[3],"with":[6,78],"intersection,":[7],"union,":[8],"concatenation":[9],"and":[10],"Kleene":[11],"closure":[12],"operators.":[13],"The":[14,30],"aim":[15],"of":[16,22,38],"this":[17,72],"paper":[18],"is":[19,33,58],"the":[20,36,42,49,55,61,66,76],"metamorphosis":[21],"semi-extended":[23,43],"to":[26,69],"deterministic":[27,50],"finite":[28,51],"automata.":[29],"proposed":[31,56],"algorithm":[32,57],"based":[34],"on":[35],"follow-positions":[37],"symbols":[39],"present":[40],"in":[41,65],"expression.":[45],"Comparison":[46],"demonstrates":[47],"that":[48],"automaton":[52],"generated":[53],"using":[54],"smaller":[59],"than":[60],"earlier":[62],"existing":[63],"approaches":[64],"literature.":[67],"Finally,":[68],"expound":[70],"upon":[71],"metamorphosis,":[73],"we":[74],"provide":[75],"reader":[77],"numerical":[79],"examples.":[80]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}