{"id":"https://openalex.org/W2894804149","doi":"https://doi.org/10.1142/s0129054118500156","title":"An Efficient Algorithm for the Construction of the Equation Tree Automaton","display_name":"An Efficient Algorithm for the Construction of the Equation Tree Automaton","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2894804149","doi":"https://doi.org/10.1142/s0129054118500156","mag":"2894804149"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054118500156","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118500156","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/A5026435500","display_name":"Ludovic Mignot","orcid":"https://orcid.org/0000-0001-8262-9707"},"institutions":[{"id":"https://openalex.org/I62396329","display_name":"Universit\u00e9 de Rouen Normandie","ror":"https://ror.org/03nhjew95","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I62396329"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Ludovic Mignot","raw_affiliation_strings":["D\u00e9partement d\u2019informatique, Universit\u00e9 de Rouen Normandie, 76801 Saint-\u00c9tienne du Rouvray Cedex, France"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement d\u2019informatique, Universit\u00e9 de Rouen Normandie, 76801 Saint-\u00c9tienne du Rouvray Cedex, France","institution_ids":["https://openalex.org/I62396329"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060310905","display_name":"Nadia Ouali-Sebti","orcid":null},"institutions":[{"id":"https://openalex.org/I62396329","display_name":"Universit\u00e9 de Rouen Normandie","ror":"https://ror.org/03nhjew95","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I62396329"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nadia Ouali-Sebti","raw_affiliation_strings":["D\u00e9partement d\u2019informatique, Universit\u00e9 de Rouen Normandie, 76801 Saint-\u00c9tienne du Rouvray Cedex, France"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement d\u2019informatique, Universit\u00e9 de Rouen Normandie, 76801 Saint-\u00c9tienne du Rouvray Cedex, France","institution_ids":["https://openalex.org/I62396329"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033485939","display_name":"Djelloul Ziadi","orcid":"https://orcid.org/0000-0001-5497-0828"},"institutions":[{"id":"https://openalex.org/I62396329","display_name":"Universit\u00e9 de Rouen Normandie","ror":"https://ror.org/03nhjew95","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I62396329"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Djelloul Ziadi","raw_affiliation_strings":["D\u00e9partement d\u2019informatique, Universit\u00e9 de Rouen Normandie, 76801 Saint-\u00c9tienne du Rouvray Cedex, France"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement d\u2019informatique, Universit\u00e9 de Rouen Normandie, 76801 Saint-\u00c9tienne du Rouvray Cedex, France","institution_ids":["https://openalex.org/I62396329"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026435500"],"corresponding_institution_ids":["https://openalex.org/I62396329"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15717975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"06","first_page":"951","last_page":"978"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9986000061035156,"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/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6375192999839783},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.5770519971847534},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5677089095115662},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.5414460301399231},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5264109969139099},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5146730542182922},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.507670521736145},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.507651686668396},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47647902369499207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4690345525741577},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.454193651676178},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45407047867774963},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.4204559922218323},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4176434874534607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.328463613986969},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.27340424060821533},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.22209814190864563},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16532406210899353}],"concepts":[{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6375192999839783},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.5770519971847534},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5677089095115662},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.5414460301399231},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5264109969139099},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5146730542182922},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.507670521736145},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.507651686668396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47647902369499207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4690345525741577},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.454193651676178},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45407047867774963},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.4204559922218323},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4176434874534607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.328463613986969},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.27340424060821533},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.22209814190864563},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16532406210899353},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054118500156","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118500156","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"},{"id":"pmh:oai:HAL:hal-02335263v1","is_oa":false,"landing_page_url":"https://normandie-univ.hal.science/hal-02335263","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Foundations of Computer Science, 2018, 29 (6), pp.951--978. ⟨10.1142/S0129054118500156⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W879751365","https://openalex.org/W1879289258","https://openalex.org/W1996651813","https://openalex.org/W2009863448","https://openalex.org/W2068361557","https://openalex.org/W2070830131","https://openalex.org/W2077450865","https://openalex.org/W2084159038","https://openalex.org/W2088432971","https://openalex.org/W2094985106","https://openalex.org/W2099540492","https://openalex.org/W2103737357","https://openalex.org/W2108142022","https://openalex.org/W2912608078"],"related_works":["https://openalex.org/W2024315516","https://openalex.org/W186350370","https://openalex.org/W2010706856","https://openalex.org/W2408583837","https://openalex.org/W2139519154","https://openalex.org/W2106606282","https://openalex.org/W2042728676","https://openalex.org/W3135656023","https://openalex.org/W2404099564","https://openalex.org/W1482505495"],"abstract_inverted_index":{"Champarnaud":[0],"et":[1,5],"al.,":[2],"and":[3,26,50,57,77,129,154],"Khorsi":[4],"al.":[6],"show":[7],"how":[8],"to":[9,35,112],"compute":[10,113],"the":[11,23,29,32,66,82,85,105,114,117,137,142,149,168,175,178],"equation":[12,33],"automaton":[13,34],"of":[14,31,69,84,88,100,108,139,141,170,177],"a":[15,36,44,52,70,97],"word":[16],"regular":[17,37],"expression":[18,39],"[Formula:":[19,40,47,53,62,74,78,89,125,133,157],"see":[20,41,48,54,63,75,79,90,126,134,158],"text]":[21,42,49,55,64,76,80,127,135],"via":[22],"C-continuations.":[24,118],"Kuske":[25,153],"Meinecke":[27,155],"extend":[28],"computation":[30],"tree":[38,87],"over":[43],"ranked":[45],"alphabet":[46],"produce":[51],"time":[56,128],"space":[58,130],"complexity":[59,169],"algorithm,":[60,120,166],"where":[61,132],"is":[65,81,122,136,145,163,172],"maximal":[67],"rank":[68],"symbol":[71],"occurring":[72],"in":[73,110,124],"size":[83,176],"syntax":[86],"text].":[91,159],"In":[92],"this":[93],"paper,":[94],"we":[95],"give":[96],"full":[98],"description":[99],"an":[101,164],"algorithm":[102,162],"based":[103,173],"on":[104,174],"acyclic":[106],"minimization":[107],"Revuz":[109],"order":[111],"pseudo-continuations":[115],"from":[116],"Our":[119],"which":[121,171],"performed":[123],"complexity,":[131],"number":[138],"states":[140],"produced":[143,179],"automaton,":[144],"more":[146],"efficient":[147],"than":[148],"one":[150],"obtained":[151],"by":[152],"since":[156],"Moreover,":[160],"our":[161],"output-sensitive":[165],"i.e.":[167],"automaton.":[180]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-10T00:00:00"}