{"id":"https://openalex.org/W2115109411","doi":"https://doi.org/10.1051/ita/2009006","title":"Nested Sibling Tree Automata","display_name":"Nested Sibling Tree Automata","publication_year":2009,"publication_date":"2009-03-11","ids":{"openalex":"https://openalex.org/W2115109411","doi":"https://doi.org/10.1051/ita/2009006","mag":"2115109411"},"language":"en","primary_location":{"id":"doi:10.1051/ita/2009006","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita/2009006","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ita/2009006.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074587903","display_name":"Fran\u00e7oise Gire","orcid":null},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I51101395","display_name":"Universit\u00e9 Paris 1 Panth\u00e9on-Sorbonne","ror":"https://ror.org/002t25c44","country_code":"FR","type":"education","lineage":["https://openalex.org/I51101395"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fran\u00e7oise Gire","raw_affiliation_strings":["Universit\u00e9 de Paris I, Centre de Recherche en Informatique Paris Cedex 13, France. gire@univ-paris1.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Paris I, Centre de Recherche en Informatique Paris Cedex 13, France. gire@univ-paris1.fr","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I51101395"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113484548","display_name":"Jean-Marc Talbot","orcid":null},"institutions":[{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Marc Talbot","raw_affiliation_strings":["Universit\u00e9 de Provence, LIF Marseille France. jean-marc.talbot@lif.univ-mrs.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Provence, LIF Marseille France. jean-marc.talbot@lif.univ-mrs.fr","institution_ids":["https://openalex.org/I21491767"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15731675,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"43","issue":"2","first_page":"379","last_page":"402"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9962999820709229,"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.9962999820709229,"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.9937999844551086,"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.9914000034332275,"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/computer-science","display_name":"Computer science","score":0.6814513206481934},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6696226596832275},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.6202070116996765},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5658510327339172},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.517458975315094},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5132915377616882},{"id":"https://openalex.org/keywords/regular-tree-grammar","display_name":"Regular tree grammar","score":0.42406702041625977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3978908956050873},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3383108973503113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33717605471611023},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3108823299407959},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.20495551824569702},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14987564086914062}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6814513206481934},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6696226596832275},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.6202070116996765},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5658510327339172},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.517458975315094},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5132915377616882},{"id":"https://openalex.org/C57097763","wikidata":"https://www.wikidata.org/wiki/Q7309622","display_name":"Regular tree grammar","level":5,"score":0.42406702041625977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3978908956050873},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3383108973503113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33717605471611023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3108823299407959},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.20495551824569702},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14987564086914062},{"id":"https://openalex.org/C69298649","wikidata":"https://www.wikidata.org/wiki/Q6045214","display_name":"Emergent grammar","level":3,"score":0.0},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.0},{"id":"https://openalex.org/C61577278","wikidata":"https://www.wikidata.org/wiki/Q11655557","display_name":"Relational grammar","level":4,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ita/2009006","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita/2009006","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:ITA_2009__43_2_379_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ita/2009006/","pdf_url":"https://www.numdam.org/item/10.1051/ita/2009006.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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:HAL:hal-00663203v1","is_oa":false,"landing_page_url":"https://paris1.hal.science/hal-00663203","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":"RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2009, 43 (2), pp.379-402. ⟨10.1051/ita/2009006⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:numdam.org:ITA_2009__43_2_379_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ita/2009006/","pdf_url":"https://www.numdam.org/item/10.1051/ita/2009006.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G5807506695","display_name":null,"funder_award_id":"ANR-08-DEFIS-04","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2115109411.pdf","grobid_xml":"https://content.openalex.org/works/W2115109411.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1501264070","https://openalex.org/W1579407214","https://openalex.org/W1967744155","https://openalex.org/W1972889860","https://openalex.org/W2030011197","https://openalex.org/W2032411923","https://openalex.org/W2035020702","https://openalex.org/W2052432706","https://openalex.org/W2151033407","https://openalex.org/W2155627592","https://openalex.org/W2167567138","https://openalex.org/W2292993340","https://openalex.org/W4232621904","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4317940153","https://openalex.org/W1548463674","https://openalex.org/W2963823488","https://openalex.org/W2953470554","https://openalex.org/W2991417553","https://openalex.org/W2108769896","https://openalex.org/W2058117339","https://openalex.org/W2243686102","https://openalex.org/W1968401573","https://openalex.org/W2907557140"],"abstract_inverted_index":{"In":[0,48],"the":[1,21,38,45,73,81,107,116,175,202,231,238],"XML":[2,30],"standard,":[3],"data":[4],"are":[5,141,242],"represented":[6],"as":[7],"unranked":[8,13,84],"labeled":[9,85],"ordered":[10],"trees.":[11,265],"Regular":[12],"tree":[14,114,121,132,181,188],"automata":[15,140,189],"provide":[16],"a":[17,53,76,110,216],"useful":[18],"formalism":[19],"for":[20,89,201],"validation":[22],"of":[23,40,75,79,97,109,113,146,161,170,179,214,233,250,256,263],"schemas":[24],"enforcing":[25],"regular":[26,46,254],"structural":[27,60,128,136],"constraints":[28,43,61,129],"on":[29,130,159,167],"documents.":[31],"However":[32],"some":[33,253],"concrete":[34],"application":[35],"contexts":[36],"need":[37],"expression":[39],"more":[41],"general":[42],"than":[44],"ones.":[47],"this":[49],"paper":[50],"we":[51],"propose":[52],"new":[54,77,111],"framework":[55,68],"in":[56,91,224],"which":[57,92,225],"context-free":[58,126],"style":[59,127],"can":[62],"be":[63],"expressed":[64],"and":[65,105,150,197,206,246],"validated.":[66],"This":[67],"is":[69,190],"characterized":[70],"by:":[71],"(i)":[72],"introduction":[74],"notion":[78,112],"trees,":[80],"so-called":[82,117],"typed":[83],"trees":[86,88,258],"(tulab":[87],"short)":[90],"each":[93],"node":[94],"receives":[95],"one":[96],"three":[98,212],"possible":[99],"types":[100],"(up,":[101],"down":[102],"or":[103,259],"fix),":[104],"(ii)":[106],"definition":[108],"automata,":[115,122],"nested":[118,185],"sibling":[119,186],"tulab":[120,131,180,187],"able":[123],"to":[124,228],"enforce":[125],"languages.":[133],"During":[134],"their":[135,168],"control":[137],"process,":[138],"such":[139],"using":[142,243],"visibly":[143],"pushdown":[144,154],"languages":[145,182,249],"words":[147],"[R.":[148],"Alur":[149],"P.":[151],"Madhusudan,":[152],"Visibly":[153],"languages,":[155],"36th":[156],"ACM":[157],"symposium":[158],"Theory":[160],"Computing,":[162],"Chicago,":[163],"USA":[164],"(2004)":[165],"202\u2013211]":[166],"alphabet":[169],"states.":[171],"We":[172,209],"show":[173],"that":[174],"resulting":[176],"class":[177],"NSTL":[178,226,251],"recognized":[183],"by":[184,219],"robust,":[191],"i.e.":[192],"closed":[193],"under":[194],"Boolean":[195],"operations":[196],"with":[198,230,252,260],"decision":[199],"procedures":[200],"classical":[203],"membership,":[204],"emptiness":[205],"inclusion":[207],"problems.":[208],"then":[210],"give":[211],"characterizations":[213,241],"NSTL:":[215],"logical":[217],"characterization":[218],"defining":[220],"an":[221],"adequate":[222,244],"logic":[223],"happens":[227],"coincide":[229],"models":[232],"monadic":[234],"second":[235],"order":[236],"sentences;":[237],"two":[239],"other":[240],"encodings":[245],"map":[247],"together":[248],"sets":[255,262],"3-ary":[257],"particular":[261],"binary":[264]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}