{"id":"https://openalex.org/W2121026849","doi":"https://doi.org/10.1142/s0129054109006917","title":"HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA","display_name":"HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA","publication_year":2009,"publication_date":"2009-09-23","ids":{"openalex":"https://openalex.org/W2121026849","doi":"https://doi.org/10.1142/s0129054109006917","mag":"2121026849"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054109006917","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054109006917","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":true,"oa_status":"green","oa_url":"https://hal.science/hal-00561373","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049597004","display_name":"Yohan Boichut","orcid":null},"institutions":[{"id":"https://openalex.org/I12449238","display_name":"Universit\u00e9 d'Orl\u00e9ans","ror":"https://ror.org/014zrew76","country_code":"FR","type":"education","lineage":["https://openalex.org/I12449238"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"YOHAN BOICHUT","raw_affiliation_strings":["LIFO Bat. 3IA Universit\u00e9 d'Orl\u00e9ans Rue L\u00e9onard de Vinci B.P. 6759 F-45067 ORLEANS, France"],"affiliations":[{"raw_affiliation_string":"LIFO Bat. 3IA Universit\u00e9 d'Orl\u00e9ans Rue L\u00e9onard de Vinci B.P. 6759 F-45067 ORLEANS, France","institution_ids":["https://openalex.org/I12449238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038883627","display_name":"Rom\u00e9o Courbis","orcid":null},"institutions":[{"id":"https://openalex.org/I90843659","display_name":"Universit\u00e9 de franche-comt\u00e9","ror":"https://ror.org/03pcc9z86","country_code":"FR","type":"education","lineage":["https://openalex.org/I90843659"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"ROMEO COURBIS","raw_affiliation_strings":["INRIA-CASSIS LIFC, Universit\u00e9 de Franche-Comt\u00e9, 16 route de Gray, 25000 Besan\u00e7on, France"],"affiliations":[{"raw_affiliation_string":"INRIA-CASSIS LIFC, Universit\u00e9 de Franche-Comt\u00e9, 16 route de Gray, 25000 Besan\u00e7on, France","institution_ids":["https://openalex.org/I90843659","https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081683705","display_name":"Pierre\u2010Cyrille H\u00e9am","orcid":"https://orcid.org/0000-0002-1125-1767"},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"PIERRE-CYRILLE HEAM","raw_affiliation_strings":["LSV, CNRS-INRIA, Ecole Normale Sup\u00e9rieure de Cachan, 61 avenue du Pr\u00e9sident Wilson, 94230 Cachan, France"],"affiliations":[{"raw_affiliation_string":"LSV, CNRS-INRIA, Ecole Normale Sup\u00e9rieure de Cachan, 61 avenue du Pr\u00e9sident Wilson, 94230 Cachan, France","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1326498283","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070920431","display_name":"Olga Kouchnarenko","orcid":"https://orcid.org/0000-0003-1482-9015"},"institutions":[{"id":"https://openalex.org/I90843659","display_name":"Universit\u00e9 de franche-comt\u00e9","ror":"https://ror.org/03pcc9z86","country_code":"FR","type":"education","lineage":["https://openalex.org/I90843659"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"OLGA KOUCHNARENKO","raw_affiliation_strings":["INRIA-CASSIS LIFC, Universit\u00e9 de Franche-Comt\u00e9, 16 route de Gray, 25000 Besan\u00e7on, France"],"affiliations":[{"raw_affiliation_string":"INRIA-CASSIS LIFC, Universit\u00e9 de Franche-Comt\u00e9, 16 route de Gray, 25000 Besan\u00e7on, France","institution_ids":["https://openalex.org/I90843659","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5049597004"],"corresponding_institution_ids":["https://openalex.org/I12449238"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.15980509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"20","issue":"05","first_page":"837","last_page":"849"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9958000183105469,"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/rewriting","display_name":"Rewriting","score":0.8439673185348511},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8212378025054932},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.7964407205581665},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.7786405682563782},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.6912006139755249},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.6664607524871826},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5903175473213196},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.521644651889801},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5204363465309143},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5063165426254272},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5062312483787537},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4585154056549072},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.45202115178108215},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4304346740245819},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.3557390570640564},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3145524561405182},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2310449481010437},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17092320322990417}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8439673185348511},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8212378025054932},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.7964407205581665},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.7786405682563782},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.6912006139755249},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.6664607524871826},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5903175473213196},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.521644651889801},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5204363465309143},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5063165426254272},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5062312483787537},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4585154056549072},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.45202115178108215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4304346740245819},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.3557390570640564},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3145524561405182},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2310449481010437},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17092320322990417},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129054109006917","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054109006917","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:CiteSeerX.psu:10.1.1.159.9425","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.9425","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-ijfcs09.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00561373v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00561373","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Foundations of Computer Science, 2009, 20 (5), pp.837--849. ⟨10.1142/S0129054109006917⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00561373v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00561373","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Foundations of Computer Science, 2009, 20 (5), pp.837--849. ⟨10.1142/S0129054109006917⟩","raw_type":"Journal articles"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.47999998927116394,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W77095868","https://openalex.org/W1488313539","https://openalex.org/W1522742464","https://openalex.org/W1526145713","https://openalex.org/W1532452539","https://openalex.org/W1551719154","https://openalex.org/W1566807398","https://openalex.org/W1569690296","https://openalex.org/W1583295953","https://openalex.org/W1586583492","https://openalex.org/W1587641948","https://openalex.org/W1593799327","https://openalex.org/W1594059499","https://openalex.org/W1858687778","https://openalex.org/W1996144424","https://openalex.org/W2001900016","https://openalex.org/W2002089154","https://openalex.org/W2026901712","https://openalex.org/W2068534652","https://openalex.org/W2070896619","https://openalex.org/W2088129830","https://openalex.org/W2101989701","https://openalex.org/W2109893633","https://openalex.org/W2123948057","https://openalex.org/W2132750992","https://openalex.org/W3022794709","https://openalex.org/W4230919050","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2170336571","https://openalex.org/W2962928105","https://openalex.org/W2020140696","https://openalex.org/W4234189135"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,21,68],"following":[4],"general":[5,64],"problem":[6,66],"of":[7,26],"tree":[8,50],"regular":[9,49],"model-checking:":[10],"decide":[11],"whether":[12],"[Formula:":[13,17,36,40,44],"see":[14,18,37,41,45],"text]":[15,19,42,46],"where":[16],"is":[20],"reflexive":[22],"and":[23,39,43],"transitive":[24],"closure":[25],"a":[27,32],"successor":[28],"relation":[29],"induced":[30],"by":[31],"term":[33,71],"rewriting":[34,72],"system":[35,73],"text],":[38],"are":[47,75],"both":[48],"languages.":[51],"We":[52],"develop":[53],"an":[54],"automatic":[55],"approximation-based":[56],"technique":[57],"to":[58],"handle":[59],"this":[60],"\u2013":[61,65],"undecidable":[62],"in":[63,67],"case":[69],"when":[70],"rules":[74],"non":[76],"left-linear.":[77]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}