{"id":"https://openalex.org/W2113322626","doi":"https://doi.org/10.1145/2274576.2274593","title":"Bounded repairability for regular tree languages","display_name":"Bounded repairability for regular tree languages","publication_year":2012,"publication_date":"2012-03-26","ids":{"openalex":"https://openalex.org/W2113322626","doi":"https://doi.org/10.1145/2274576.2274593","mag":"2113322626"},"language":"en","primary_location":{"id":"doi:10.1145/2274576.2274593","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2274576.2274593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Conference on Database Theory","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-00643100","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105824253","display_name":"Gabriele Puppis","orcid":"https://orcid.org/0000-0001-9831-3264"},"institutions":[{"id":"https://openalex.org/I4210146410","display_name":"Science Oxford","ror":"https://ror.org/04j8yhy50","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210146410"]},{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Gabriele Puppis","raw_affiliation_strings":["University of Oxford, UK","Department of Computer Science [Oxford] (University of Oxford Wolfson Building Parks Road OXFORD OX1 3QD UK - United Kingdom)"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Department of Computer Science [Oxford] (University of Oxford Wolfson Building Parks Road OXFORD OX1 3QD UK - United Kingdom)","institution_ids":["https://openalex.org/I40120149","https://openalex.org/I4210146410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083030983","display_name":"Cristian Riveros","orcid":"https://orcid.org/0000-0003-0832-116X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]},{"id":"https://openalex.org/I4210146410","display_name":"Science Oxford","ror":"https://ror.org/04j8yhy50","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210146410"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Cristian Riveros","raw_affiliation_strings":["University of Oxford, UK","Department of Computer Science [Oxford] (University of Oxford Wolfson Building Parks Road OXFORD OX1 3QD UK - United Kingdom)"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Department of Computer Science [Oxford] (University of Oxford Wolfson Building Parks Road OXFORD OX1 3QD UK - United Kingdom)","institution_ids":["https://openalex.org/I40120149","https://openalex.org/I4210146410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038280683","display_name":"S\u0142awek Staworko","orcid":"https://orcid.org/0000-0003-3684-3395"},"institutions":[{"id":"https://openalex.org/I2279609970","display_name":"Universit\u00e9 de Lille","ror":"https://ror.org/02kzqn938","country_code":"FR","type":"education","lineage":["https://openalex.org/I2279609970"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S\u0142awek Staworko","raw_affiliation_strings":["University of Lille, France","MOSTRARE - Modeling Tree Structures, Machine Learning, and Information Extraction (France)"],"affiliations":[{"raw_affiliation_string":"University of Lille, France","institution_ids":["https://openalex.org/I2279609970"]},{"raw_affiliation_string":"MOSTRARE - Modeling Tree Structures, Machine Learning, and Information Extraction (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5105824253"],"corresponding_institution_ids":["https://openalex.org/I40120149","https://openalex.org/I4210146410"],"apc_list":null,"apc_paid":null,"fwci":0.6911,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73120611,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"155","last_page":"168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9986000061035156,"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.9986000061035156,"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/T12029","display_name":"DNA and Biological Computing","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9801999926567078,"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/regular-language","display_name":"Regular language","score":0.7787107229232788},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.627692699432373},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.604736328125},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5894601941108704},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5865362286567688},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5137454271316528},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.5112874507904053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5108494162559509},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4677797555923462},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46667611598968506},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.4383939802646637},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4361104667186737},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4263274371623993},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3761575222015381},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18172955513000488}],"concepts":[{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.7787107229232788},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.627692699432373},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.604736328125},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5894601941108704},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5865362286567688},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5137454271316528},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.5112874507904053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5108494162559509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4677797555923462},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46667611598968506},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.4383939802646637},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4361104667186737},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4263274371623993},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3761575222015381},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18172955513000488},{"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/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1145/2274576.2274593","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2274576.2274593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Conference on Database Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.230.5987","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.230.5987","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ox.ac.uk/files/4433/icdt12.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.302.4606","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.302.4606","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://fox7.eu/wp-content/uploads/treerepair.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.594.638","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.594.638","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/docs/00/87/70/62/PDF/ICDT_2012.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.636.775","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.univ-lille3.fr/docs/00/64/31/00/PDF/staworko-icdt12b.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.712.4591","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.712.4591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.labri.fr/perso/gpuppis/articles/ICDT%202012.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00643100v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00643100","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":"15th International Conference on Database Theory, ICDT, Mar 2012, Berlin, Germany. pp.155-168, ⟨10.1145/2274576.2274593⟩","raw_type":"Conference papers"},{"id":"pmh:oai:air.uniud.it:11390/1174074","is_oa":false,"landing_page_url":"http://hdl.handle.net/11390/1174074","pdf_url":null,"source":{"id":"https://openalex.org/S4306401163","display_name":"Institutional Research Information System (University of Udine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129043915","host_organization_name":"University of Udine","host_organization_lineage":["https://openalex.org/I129043915"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/173795b5-ba3d-4191-9473-3812ca73d5a3","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/173795b5-ba3d-4191-9473-3812ca73d5a3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Puppis, G, Riveros, C & Staworko, S 2012, Bounded repairability for regular tree languages. in 15th International Conference on Database Theory, ICDT '12, Berlin, Germany, March 26-29, 2012. pp. 155-168. https://doi.org/10.1145/2274576.2274593","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/173795b5-ba3d-4191-9473-3812ca73d5a3","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/bounded-repairability-for-regular-tree-languages(173795b5-ba3d-4191-9473-3812ca73d5a3).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00643100v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00643100","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":"15th International Conference on Database Theory, ICDT, Mar 2012, Berlin, Germany. pp.155-168, ⟨10.1145/2274576.2274593⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1929273819","display_name":"Enforcement of Constraints on XML Streams","funder_award_id":"EP/G004021/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3302898249","display_name":null,"funder_award_id":"FEDER","funder_id":"https://openalex.org/F4320322727","funder_display_name":"Minist\u00e8re de l'Education Nationale, de l'Enseignement Superieur et de la Recherche"},{"id":"https://openalex.org/G5572975616","display_name":null,"funder_award_id":"ANR-08-DEFIS-004","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G582362311","display_name":null,"funder_award_id":"FP7-ICT-233599","funder_id":"https://openalex.org/F4320334960","funder_display_name":"Seventh Framework Programme"},{"id":"https://openalex.org/G7246022940","display_name":null,"funder_award_id":"EP/G004021/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320322727","display_name":"Minist\u00e8re de l'Education Nationale, de l'Enseignement Superieur et de la Recherche","ror":"https://ror.org/03sjk9a61"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320338370","display_name":"FP7 Information and Communication Technologies","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1495774331","https://openalex.org/W1505425738","https://openalex.org/W1512194759","https://openalex.org/W1525042524","https://openalex.org/W1623927329","https://openalex.org/W1900845398","https://openalex.org/W1978460233","https://openalex.org/W1978478796","https://openalex.org/W1988699971","https://openalex.org/W1998084650","https://openalex.org/W2019540568","https://openalex.org/W2019789808","https://openalex.org/W2057841333","https://openalex.org/W2059078591","https://openalex.org/W2077518845","https://openalex.org/W2090802466","https://openalex.org/W2092398161","https://openalex.org/W2110367171","https://openalex.org/W2121843890","https://openalex.org/W2129828874","https://openalex.org/W2131886132","https://openalex.org/W2164676507","https://openalex.org/W2998389348"],"related_works":["https://openalex.org/W2113425091","https://openalex.org/W2146605784","https://openalex.org/W1999162684","https://openalex.org/W3143588635","https://openalex.org/W2160879187","https://openalex.org/W2281054049","https://openalex.org/W2394954760","https://openalex.org/W2113629662","https://openalex.org/W2167032348","https://openalex.org/W3104063683"],"abstract_inverted_index":{"We":[0,71],"consider":[1],"the":[2,33,76,93,96,102,121],"problem":[3,97,123],"of":[4,35,62,69,75,78,95,101,127],"repairing":[5],"unranked":[6,21],"trees":[7,22],"(e.g.,":[8,17,106],"XML":[9],"documents)":[10],"satisfying":[11,23],"a":[12,18,24,44,57,86],"given":[13,25],"restriction":[14],"specification":[15,27],"R":[16,47,80],"DTD)":[19],"into":[20],"target":[26],"T.":[28],"Specifically,":[29],"we":[30,91,115],"focus":[31],"on":[32],"question":[34],"whether":[36],"one":[37],"can":[38],"get":[39],"from":[40],"any":[41],"tree":[42,50,104],"in":[43,51,133],"regular":[45,53,103,125],"language":[46,54],"to":[48],"some":[49,118],"another":[52],"T":[55,82],"with":[56,120],"finite,":[58],"uniformly":[59],"bounded,":[60],"number":[61],"edit":[63],"operations":[64],"(i.e.,":[65],"deletions":[66],"and":[67,81,90],"insertions":[68],"nodes).":[70],"give":[72],"effective":[73],"characterizations":[74],"pairs":[77],"specifications":[79],"for":[83,124],"which":[84,129],"such":[85],"uniform":[87],"bound":[88],"exists,":[89],"study":[92],"complexity":[94],"under":[98],"different":[99],"representations":[100],"languages":[105,126],"non-deterministic":[107],"stepwise":[108,111],"automata,":[109,112],"deterministic":[110],"DTDs).":[113],"Finally,":[114],"point":[116],"out":[117],"connections":[119],"analogous":[122],"words,":[128],"was":[130],"previously":[131],"studied":[132],"[6].":[134]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}