{"id":"https://openalex.org/W2108769896","doi":"https://doi.org/10.1145/1265530.1265564","title":"Marrying words and trees","display_name":"Marrying words and trees","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W2108769896","doi":"https://doi.org/10.1145/1265530.1265564","mag":"2108769896"},"language":"en","primary_location":{"id":"doi:10.1145/1265530.1265564","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1265530.1265564","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/A5065059795","display_name":"Rajeev Alur","orcid":"https://orcid.org/0000-0003-1733-7083"},"institutions":[{"id":"https://openalex.org/I36788626","display_name":"California University of Pennsylvania","ror":"https://ror.org/01spssf70","country_code":"US","type":"education","lineage":["https://openalex.org/I36788626"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rajeev Alur","raw_affiliation_strings":["University of Pennsylvania","#N# * University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania","institution_ids":["https://openalex.org/I36788626"]},{"raw_affiliation_string":"#N# * University of Pennsylvania","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065059795"],"corresponding_institution_ids":["https://openalex.org/I36788626"],"apc_list":null,"apc_paid":null,"fwci":11.2643,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.98344587,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"233","last_page":"242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9997000098228455,"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.9997000098228455,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"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/T11567","display_name":"semigroups and automata theory","score":0.9993000030517578,"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/succinctness","display_name":"Succinctness","score":0.8865200281143188},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.8457165956497192},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7336747646331787},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6235566139221191},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.6208802461624146},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5860350131988525},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5243692398071289},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.49678924679756165},{"id":"https://openalex.org/keywords/regular-tree-grammar","display_name":"Regular tree grammar","score":0.4728665053844452},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.46795642375946045},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.4632185101509094},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44587117433547974},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.4062112867832184},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3316327929496765},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.3101283311843872},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28902101516723633},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2704584002494812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1652805209159851}],"concepts":[{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.8865200281143188},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.8457165956497192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7336747646331787},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6235566139221191},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.6208802461624146},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5860350131988525},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5243692398071289},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.49678924679756165},{"id":"https://openalex.org/C57097763","wikidata":"https://www.wikidata.org/wiki/Q7309622","display_name":"Regular tree grammar","level":5,"score":0.4728665053844452},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.46795642375946045},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.4632185101509094},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44587117433547974},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.4062112867832184},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3316327929496765},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3101283311843872},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28902101516723633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2704584002494812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1652805209159851},{"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},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1265530.1265564","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1265530.1265564","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6100000143051147,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1492682035","https://openalex.org/W1508317128","https://openalex.org/W1516541943","https://openalex.org/W1548569630","https://openalex.org/W1579407214","https://openalex.org/W1587779614","https://openalex.org/W1593799327","https://openalex.org/W1725438563","https://openalex.org/W1856962451","https://openalex.org/W1965061701","https://openalex.org/W1988078800","https://openalex.org/W2092398161","https://openalex.org/W2099205674","https://openalex.org/W2135909702","https://openalex.org/W2137370934","https://openalex.org/W2151033407","https://openalex.org/W2294348221","https://openalex.org/W2911298563","https://openalex.org/W4285719527","https://openalex.org/W6673449916"],"related_works":["https://openalex.org/W2004312423","https://openalex.org/W2108769896","https://openalex.org/W1559554095","https://openalex.org/W2030569822","https://openalex.org/W2137997862","https://openalex.org/W2151788193","https://openalex.org/W1987994907","https://openalex.org/W2172205179","https://openalex.org/W2115109411","https://openalex.org/W2950668706"],"abstract_inverted_index":{"Traditionally,":[0],"data":[1],"that":[2,29,74,107],"has":[3],"both":[4,51,58],"linear":[5],"and":[6,19,32,43,53,56,60,72,79,84,90,99,120,134],"hierarchical":[7],"structure,":[8],"such":[9],"as":[10],"annotated":[11],"linguistic":[12],"data,":[13],"is":[14],"modeled":[15],"using":[16,21],"ordered":[17,54],"trees":[18],"queried":[20],"tree":[22,61,85,100,118,136],"automata.":[23],"In":[24,103],"this":[25],"paper,":[26],"we":[27,105],"argue":[28],"nested":[30,35,70,109,122],"words":[31,36,49,52],"automata":[33,68,111,124],"over":[34,69,82],"offer":[37],"a":[38],"better":[39],"way":[40],"to":[41,95],"capture":[42],"process":[44],"the":[45,96,126],"dual":[46],"structure.":[47],"Nested":[48],"generalize":[50],"trees,":[55],"allow":[57],"word":[59,83,98,110,123,132],"operations.":[62],"We":[63],"study":[64],"various":[65],"classes":[66,129],"of":[67,130],"words,":[71],"show":[73,106],"while":[75],"they":[76],"enjoy":[77],"expressiveness":[78],"succinctness":[80],"benefits":[81],"automata,":[86,119],"their":[87],"analysis":[88],"complexity":[89],"closure":[91],"properties":[92],"are":[93],"analogous":[94],"corresponding":[97],"special":[101],"cases.":[102],"particular,":[104],"finite-state":[108],"can":[112],"be":[113],"exponentially":[114],"more":[115],"succinct":[116],"than":[117],"pushdown":[121],"include":[125],"two":[127],"incomparable":[128],"context-free":[131,135],"languages":[133],"languages.":[137]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}