{"id":"https://openalex.org/W1978177681","doi":"https://doi.org/10.1145/1265530.1265540","title":"XML transformation by tree-walking transducers with invisible pebbles","display_name":"XML transformation by tree-walking transducers with invisible pebbles","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W1978177681","doi":"https://doi.org/10.1145/1265530.1265540","mag":"1978177681"},"language":"en","primary_location":{"id":"doi:10.1145/1265530.1265540","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1265530.1265540","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-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/A5110094636","display_name":"Joost Engelfriet","orcid":null},"institutions":[{"id":"https://openalex.org/I121797337","display_name":"Leiden University","ror":"https://ror.org/027bh9e22","country_code":"NL","type":"education","lineage":["https://openalex.org/I121797337"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Joost Engelfriet","raw_affiliation_strings":["Leiden University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Leiden University","institution_ids":["https://openalex.org/I121797337"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076270944","display_name":"Hendrik Jan Hoogeboom","orcid":"https://orcid.org/0000-0002-6673-0124"},"institutions":[{"id":"https://openalex.org/I121797337","display_name":"Leiden University","ror":"https://ror.org/027bh9e22","country_code":"NL","type":"education","lineage":["https://openalex.org/I121797337"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Hendrik Jan Hoogeboom","raw_affiliation_strings":["Leiden University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Leiden University","institution_ids":["https://openalex.org/I121797337"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058202025","display_name":"Bart Samwel","orcid":null},"institutions":[{"id":"https://openalex.org/I121797337","display_name":"Leiden University","ror":"https://ror.org/027bh9e22","country_code":"NL","type":"education","lineage":["https://openalex.org/I121797337"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bart Samwel","raw_affiliation_strings":["Leiden University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Leiden University","institution_ids":["https://openalex.org/I121797337"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.8752,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.93287066,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"63","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9919000267982483,"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"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9919000267982483,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9886000156402588,"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/T11269","display_name":"Algorithms and Data Compression","score":0.984000027179718,"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/decidability","display_name":"Decidability","score":0.7389423847198486},{"id":"https://openalex.org/keywords/xpath","display_name":"XPath","score":0.7248885035514832},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.694015383720398},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.6865155696868896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6727855205535889},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5584191679954529},{"id":"https://openalex.org/keywords/xslt","display_name":"XSLT","score":0.5347456336021423},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4932641386985779},{"id":"https://openalex.org/keywords/path-expression","display_name":"Path expression","score":0.455240935087204},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.4513475298881531},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4415072202682495},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.4400516450405121},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4304085075855255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4274978041648865},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3114246129989624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2879013419151306},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14164602756500244}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7389423847198486},{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.7248885035514832},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.694015383720398},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.6865155696868896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6727855205535889},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5584191679954529},{"id":"https://openalex.org/C150569060","wikidata":"https://www.wikidata.org/wiki/Q32110","display_name":"XSLT","level":3,"score":0.5347456336021423},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4932641386985779},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.455240935087204},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.4513475298881531},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4415072202682495},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.4400516450405121},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4304085075855255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4274978041648865},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3114246129989624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2879013419151306},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14164602756500244},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C55348073","wikidata":"https://www.wikidata.org/wiki/Q595926","display_name":"XML validation","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1265530.1265540","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1265530.1265540","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.95.7533","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.7533","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.liacs.nl/~hoogeboo/praatjes/pebbles/pods07-invisible.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W325994626","https://openalex.org/W1489400044","https://openalex.org/W1540516609","https://openalex.org/W1548593662","https://openalex.org/W1557116728","https://openalex.org/W1571327583","https://openalex.org/W1686175813","https://openalex.org/W1966106497","https://openalex.org/W1977578205","https://openalex.org/W1979629711","https://openalex.org/W1981870753","https://openalex.org/W1993233874","https://openalex.org/W2015791837","https://openalex.org/W2033314366","https://openalex.org/W2035020702","https://openalex.org/W2035285350","https://openalex.org/W2073663206","https://openalex.org/W2074385562","https://openalex.org/W2079625718","https://openalex.org/W2115587183","https://openalex.org/W2128710701","https://openalex.org/W2136451095","https://openalex.org/W2151259708","https://openalex.org/W2294034341","https://openalex.org/W2538148032","https://openalex.org/W2689729627","https://openalex.org/W3147269505","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2362382374","https://openalex.org/W2486756614","https://openalex.org/W2346169362","https://openalex.org/W1572574718","https://openalex.org/W2062115694","https://openalex.org/W1716100575","https://openalex.org/W2412587119","https://openalex.org/W1491593584","https://openalex.org/W2045475803","https://openalex.org/W2380537840"],"abstract_inverted_index":{"The":[0,27,78,111],"pebble":[1,6,29],"tree":[2,7,30,35],"automaton":[3],"and":[4,43,102],"the":[5,23,33,106,131],"transducer":[8],"are":[9],"enhanced":[10],"by":[11],"additionally":[12],"allowing":[13],"an":[14,64],"unbounded":[15],"number":[16],"of":[17,49,109,133],"\"invisible\"":[18],"pebbles":[19],"(as":[20],"opposed":[21],"to":[22,63,88],"usual":[24],"(\"visible\"":[25],"ones).":[26],"resulting":[28,79],"automata":[31],"recognize":[32],"regular":[34],"languages":[36],"(i.e.,":[37],"can":[38,45,82,104,126],"validate":[39],"all":[40,47],"generalized":[41],"DTD's)":[42],"hence":[44],"find":[46],"matches":[48],"MSO":[50,74,85,122],"definable":[51,75,86,123],"n-ary":[52],"patterns.":[53],"Moreover,":[54],"when":[55],"viewed":[56],"as":[57],"a":[58,69,98],"navigational":[59],"device,":[60],"they":[61,95,103],"lead":[62],"XPath-like":[65],"formalism":[66],"that":[67,120],"has":[68],"path":[70],"expression":[71],"for":[72,117],"every":[73],"binary":[76,124],"pattern.":[77],"pebbletree":[80],"transducers":[81],"apply":[83],"arbitrary":[84],"tests":[87],"(the":[89],"observable":[90],"part":[91],"of)":[92],"their":[93],"configurations,":[94],"(still)":[96],"have":[97],"decidable":[99],"typechecking":[100,115],"problem,":[101],"model":[105],"recursion":[107],"mechanism":[108],"XSLT.":[110],"time":[112],"complexity":[113],"ofthe":[114],"problem":[116],"conjunctive":[118],"queries":[119],"use":[121,132],"patterns":[125],"often":[127],"be":[128],"reduced":[129],"through":[130],"invisible":[134],"pebbles.":[135]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}