{"id":"https://openalex.org/W3191465415","doi":"https://doi.org/10.3390/a14080238","title":"Efficient Construction of the Equation Automaton","display_name":"Efficient Construction of the Equation Automaton","publication_year":2021,"publication_date":"2021-08-11","ids":{"openalex":"https://openalex.org/W3191465415","doi":"https://doi.org/10.3390/a14080238","mag":"3191465415"},"language":"en","primary_location":{"id":"doi:10.3390/a14080238","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080238","pdf_url":"https://www.mdpi.com/1999-4893/14/8/238/pdf?version=1628760708","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/8/238/pdf?version=1628760708","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072626701","display_name":"Fa\u00efssal Ouardi","orcid":"https://orcid.org/0000-0002-7636-5001"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":true,"raw_author_name":"Faissal Ouardi","raw_affiliation_strings":["Department of Computer Science, Faculty of Sciences, Mohammed V University in Rabat, Rabat 10000, Morocco"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Sciences, Mohammed V University in Rabat, Rabat 10000, Morocco","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008214002","display_name":"Zineb Lotfi","orcid":null},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Zineb Lotfi","raw_affiliation_strings":["Department of Computer Science, Faculty of Sciences, Mohammed V University in Rabat, Rabat 10000, Morocco"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Sciences, Mohammed V University in Rabat, Rabat 10000, Morocco","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087650574","display_name":"Bilal Elghadyry","orcid":"https://orcid.org/0000-0002-8034-5855"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]},{"id":"https://openalex.org/I2802487185","display_name":"Universit\u00e9 du littoral c\u00f4te d'opale","ror":"https://ror.org/02gdcg342","country_code":"FR","type":"education","lineage":["https://openalex.org/I2802487185"]},{"id":"https://openalex.org/I4387154658","display_name":"Laboratoire d\u2019Informatique Signal et Image de la C\u00f4te d\u2019Opale","ror":"https://ror.org/00tm1qp20","country_code":null,"type":"facility","lineage":["https://openalex.org/I2802487185","https://openalex.org/I4387154658"]}],"countries":["FR","MA"],"is_corresponding":false,"raw_author_name":"Bilal Elghadyry","raw_affiliation_strings":["Department of Computer Science, Faculty of Sciences, Mohammed V University in Rabat, Rabat 10000, Morocco","EA 4491-LISIC-Lab., Laboratoire d\u2019Informatique Signal et Image de la C\u00f4te d\u2019Opale Universit\u00e9 Littoral C\u00f4te d\u2019Opale, 62100 Calais, France"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Faculty of Sciences, Mohammed V University in Rabat, Rabat 10000, Morocco","institution_ids":["https://openalex.org/I126477371"]},{"raw_affiliation_string":"EA 4491-LISIC-Lab., Laboratoire d\u2019Informatique Signal et Image de la C\u00f4te d\u2019Opale Universit\u00e9 Littoral C\u00f4te d\u2019Opale, 62100 Calais, France","institution_ids":["https://openalex.org/I2802487185","https://openalex.org/I4387154658"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072626701"],"corresponding_institution_ids":["https://openalex.org/I126477371"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.148,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.513305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"8","first_page":"238","last_page":"238"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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.9975000023841858,"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/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.8333295583724976},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.8189476728439331},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.6633648872375488},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6412931680679321},{"id":"https://openalex.org/keywords/continuous-automaton","display_name":"Continuous automaton","score":0.640277624130249},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.6387271881103516},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.6134825944900513},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6116225719451904},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5779495239257812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5457453727722168},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5022480487823486},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5017986297607422},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.4847942888736725},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.4762682616710663},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4387586712837219},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4303189516067505},{"id":"https://openalex.org/keywords/continuation","display_name":"Continuation","score":0.4249749481678009},{"id":"https://openalex.org/keywords/mobile-automaton","display_name":"Mobile automaton","score":0.42241668701171875},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.37799665331840515},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3509975075721741},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2603466510772705}],"concepts":[{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.8333295583724976},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.8189476728439331},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.6633648872375488},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6412931680679321},{"id":"https://openalex.org/C21720249","wikidata":"https://www.wikidata.org/wiki/Q5165460","display_name":"Continuous automaton","level":5,"score":0.640277624130249},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.6387271881103516},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.6134825944900513},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6116225719451904},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5779495239257812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5457453727722168},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5022480487823486},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5017986297607422},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4847942888736725},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.4762682616710663},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4387586712837219},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4303189516067505},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.4249749481678009},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.42241668701171875},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.37799665331840515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3509975075721741},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2603466510772705},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a14080238","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080238","pdf_url":"https://www.mdpi.com/1999-4893/14/8/238/pdf?version=1628760708","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03515718v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03515718","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, 2021, 14 (8), pp.238. &#x27E8;10.3390/a14080238&#x27E9;","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:ccf9f1f2fe244186a4cb476beeebbe83","is_oa":true,"landing_page_url":"https://doaj.org/article/ccf9f1f2fe244186a4cb476beeebbe83","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 8, p 238 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/8/238/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14080238","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 8; Pages: 238","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14080238","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080238","pdf_url":"https://www.mdpi.com/1999-4893/14/8/238/pdf?version=1628760708","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3191465415.pdf","grobid_xml":"https://content.openalex.org/works/W3191465415.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1501213188","https://openalex.org/W1523321977","https://openalex.org/W1570445666","https://openalex.org/W1572916762","https://openalex.org/W1584451387","https://openalex.org/W1810686855","https://openalex.org/W2002089154","https://openalex.org/W2009863448","https://openalex.org/W2010443277","https://openalex.org/W2070830131","https://openalex.org/W2072607050","https://openalex.org/W2077450865","https://openalex.org/W2081929761","https://openalex.org/W2084159038","https://openalex.org/W2088432971","https://openalex.org/W2094985106","https://openalex.org/W2099540492","https://openalex.org/W2122493035","https://openalex.org/W2129414328","https://openalex.org/W2912608078","https://openalex.org/W3150132563","https://openalex.org/W4206635485"],"related_works":["https://openalex.org/W2026879508","https://openalex.org/W2155870982","https://openalex.org/W2042728676","https://openalex.org/W2139519154","https://openalex.org/W63685668","https://openalex.org/W2522171317","https://openalex.org/W3191465415","https://openalex.org/W1482505495","https://openalex.org/W2581079654","https://openalex.org/W1986238652"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,19,27,35,85],"fast":[4,86],"algorithm":[5,69,103,138],"for":[6,70],"constructing":[7],"directly":[8],"the":[9,13,38,51,77,89,107,124,129],"equation":[10,39,90,130],"automaton":[11,16,40,55,91],"from":[12],"well-known":[14],"Thompson":[15,54],"associated":[17],"with":[18,41],"regular":[20],"expression.":[21],"Allauzen":[22],"and":[23,33,43,67,110,135],"Mohri":[24],"have":[25],"presented":[26,84],"unified":[28],"construction":[29,36],"of":[30,37,53,79,88,106,126,128,139],"small":[31],"automata":[32,63],"gave":[34],"time":[42,94],"space":[44],"complexity":[45,115],"in":[46,92],"O(mlogm+m2),":[47],"where":[48,121],"m":[49],"denotes":[50,123],"number":[52,125],"transitions.":[56],"It":[57],"is":[58],"based":[59],"on":[60],"two":[61],"classical":[62],"operations,":[64],"namely":[65],"epsilon-removal":[66,134],"Hopcroft\u2019s":[68],"deterministic":[71],"Finite":[72,143],"Automata":[73,144],"(DFA)":[74],"minimization.":[75],"Using":[76],"notion":[78],"c-continuation,":[80],"Ziadi":[81],"et":[82],"al.":[83],"computation":[87],"O(m2)":[93],"complexity.":[95],"In":[96],"this":[97],"paper,":[98],"we":[99],"design":[100],"an":[101,133,140],"output-sensitive":[102],"combining":[104],"advantages":[105],"previous":[108],"algorithms":[109],"show":[111],"that":[112],"its":[113],"computational":[114],"can":[116],"be":[117],"reduced":[118],"to":[119],"O(m\u00d7|Q\u2261e|),":[120],"|Q\u2261e|":[122],"states":[127],"automaton,":[131],"by":[132],"Bubenzer":[136],"minimization":[137],"Acyclic":[141],"Deterministic":[142],"(ADFA).":[145]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2021-08-16T00:00:00"}
