{"id":"https://openalex.org/W2121862172","doi":"https://doi.org/10.2168/lmcs-9(2:1)2013","title":"Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories","display_name":"Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories","publication_year":2013,"publication_date":"2013-04-02","ids":{"openalex":"https://openalex.org/W2121862172","doi":"https://doi.org/10.2168/lmcs-9(2:1)2013","mag":"2121862172"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-9(2:1)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(2:1)2013","pdf_url":"https://lmcs.episciences.org/1161/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1161/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Luis Bargu\u00f1\u00f3","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Luis Bargu\u00f1\u00f3","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Carles Creus","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Carles Creus","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Guillem Godoy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guillem Godoy","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Florent Jacquemard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Florent Jacquemard","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Camille Vacher","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Camille Vacher","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4923,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.83614304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"Volume 9, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.6532999873161316,"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.6532999873161316,"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/T11567","display_name":"semigroups and automata theory","score":0.22110000252723694,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.022299999371170998,"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/decidability","display_name":"Decidability","score":0.8069999814033508},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7010999917984009},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5346999764442444},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5210000276565552},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.48350000381469727},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4726000130176544},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4713999927043915},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.40619999170303345},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.3871999979019165}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8069999814033508},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7010999917984009},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5346999764442444},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.531000018119812},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5210000276565552},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5073000192642212},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.48350000381469727},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4726000130176544},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4713999927043915},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.40619999170303345},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3695000112056732},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3314000070095062},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3310999870300293},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.31450000405311584},{"id":"https://openalex.org/C2779150620","wikidata":"https://www.wikidata.org/wiki/Q1096367","display_name":"Emptiness","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.2773999869823456},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.2678000032901764},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.265500009059906},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-9(2:1)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(2:1)2013","pdf_url":"https://lmcs.episciences.org/1161/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1302.6960","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1302.6960","pdf_url":"https://arxiv.org/pdf/1302.6960","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:62e8b39888374559a6a263c671469703","is_oa":true,"landing_page_url":"https://doaj.org/article/62e8b39888374559a6a263c671469703","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":"Logical Methods in Computer Science, Vol Volume 9, Issue 2 (2013)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-9(2:1)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(2:1)2013","pdf_url":"https://lmcs.episciences.org/1161/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320313934","display_name":"Institut national de recherche en informatique et en automatique (INRIA)","ror":"https://ror.org/02kvxyf05"},{"id":"https://openalex.org/F4320338370","display_name":"FP7 Information and Communication Technologies","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2121862172.pdf","grobid_xml":"https://content.openalex.org/works/W2121862172.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,106,129,169],"define":[1],"a":[2,45,65,77,100,158,167,179,191],"class":[3],"of":[4,19,32,99,109,122,125,143,145,151,155,181,190,193],"ranked":[5],"tree":[6,12],"automata":[7,13],"TABG":[8,37,69],"generalizing":[9],"both":[10],"the":[11,61,74,110,119,123,141,149,172,188,194],"with":[14,25,202],"local":[15],"tests":[16],"between":[17,50,54,208],"brothers":[18],"Bogaert":[20],"and":[21,24,28,42,53,206,210],"Tison":[22],"(1992)":[23],"global":[26,136],"equality":[27,41,205],"disequality":[29,43,207],"constraints":[30,89,138],"(TAGED)":[31],"Filiot":[33],"et":[34],"al.":[35],"(2007).":[36],"can":[38,70],"test":[39],"for":[40,90,113,127,139,184,204],"modulo":[44],"given":[46,78,101,159],"flat":[47,160],"equational":[48,161],"theory":[49],"brother":[51],"subterms":[52,55,75,156],"whose":[56],"positions":[57,98],"are":[58,80],"defined":[59],"by":[60,134],"states":[62],"reached":[63],"during":[64,166],"computation.":[66,168],"In":[67],"particular,":[68,118],"check":[71],"that":[72,94],"all":[73],"reaching":[76,163],"state":[79,147,165],"distinct.":[81],"This":[82,115],"constraint":[83],"is":[84],"related":[85],"to":[86,174],"monadic":[87,195],"key":[88],"XML":[91],"documents,":[92],"meaning":[93],"every":[95],"two":[96],"distinct":[97],"type":[102],"have":[103],"different":[104,152],"values.":[105],"prove":[107,187],"decidability":[108,124,189],"emptiness":[111,126],"problem":[112],"TABG.":[114],"solves,":[116],"in":[117],"open":[120],"question":[121],"TAGED.":[128],"further":[130],"extend":[131],"our":[132,182],"result":[133],"allowing":[135],"arithmetic":[137],"counting":[140],"number":[142,150],"occurrences":[144],"some":[146,164],"or":[148],"equivalence":[153],"classes":[154],"(modulo":[157],"theory)":[162],"also":[170],"adapt":[171],"model":[173],"unranked":[175],"ordered":[176],"terms.":[177],"As":[178],"consequence":[180],"results":[183],"TABG,":[185],"we":[186],"fragment":[192],"second":[196],"order":[197],"logic":[198],"on":[199],"trees":[200],"extended":[201],"predicates":[203],"subtrees,":[209],"cardinality.":[211]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2016-06-24T00:00:00"}