{"id":"https://openalex.org/W2131886132","doi":"https://doi.org/10.1145/1516512.1516518","title":"Adding nesting structure to words","display_name":"Adding nesting structure to words","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2131886132","doi":"https://doi.org/10.1145/1516512.1516518","mag":"2131886132"},"language":"en","primary_location":{"id":"doi:10.1145/1516512.1516518","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1516512.1516518","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-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/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rajeev Alur","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, Pennsylvania","UNIVERSITY OF PENNSYLVANIA PHILADELPHIA, PENNSYLVANIA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, Pennsylvania","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"UNIVERSITY OF PENNSYLVANIA PHILADELPHIA, PENNSYLVANIA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112870293","display_name":"P. Madhusudan","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Madhusudan","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Urbana, Illinois"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Urbana, Illinois","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065059795"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":27.4214,"has_fulltext":false,"cited_by_count":327,"citation_normalized_percentile":{"value":0.99802825,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"56","issue":"3","first_page":"1","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.9975000023841858,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.6914218664169312},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6451637744903564},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5985605716705322},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.549691379070282},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.5271817445755005},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5234236717224121},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.4683845341205597},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.37818342447280884},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3475176692008972},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33164697885513306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32906150817871094},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.24085235595703125},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2288486659526825},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.21587267518043518},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.1369757056236267},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.11960944533348083}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6914218664169312},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6451637744903564},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5985605716705322},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.549691379070282},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.5271817445755005},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5234236717224121},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.4683845341205597},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.37818342447280884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3475176692008972},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33164697885513306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32906150817871094},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.24085235595703125},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2288486659526825},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.21587267518043518},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.1369757056236267},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.11960944533348083},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1516512.1516518","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1516512.1516518","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G1489613379","display_name":null,"funder_award_id":"DAAD19-01-0473","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G4154382855","display_name":null,"funder_award_id":"CCR-0306382CPA-0541149","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W148396834","https://openalex.org/W157185084","https://openalex.org/W191660820","https://openalex.org/W421997344","https://openalex.org/W1492682035","https://openalex.org/W1504739534","https://openalex.org/W1508317128","https://openalex.org/W1508555606","https://openalex.org/W1516541943","https://openalex.org/W1548569630","https://openalex.org/W1556462035","https://openalex.org/W1556566737","https://openalex.org/W1560050980","https://openalex.org/W1579407214","https://openalex.org/W1587779614","https://openalex.org/W1589224558","https://openalex.org/W1590044367","https://openalex.org/W1593799327","https://openalex.org/W1691700263","https://openalex.org/W1725438563","https://openalex.org/W1827592073","https://openalex.org/W1856962451","https://openalex.org/W1889920293","https://openalex.org/W1971616901","https://openalex.org/W1988078800","https://openalex.org/W1990609140","https://openalex.org/W2002089154","https://openalex.org/W2023552752","https://openalex.org/W2023808162","https://openalex.org/W2029087760","https://openalex.org/W2059078591","https://openalex.org/W2066725205","https://openalex.org/W2080573945","https://openalex.org/W2092398161","https://openalex.org/W2108769896","https://openalex.org/W2114132089","https://openalex.org/W2119736157","https://openalex.org/W2129097092","https://openalex.org/W2135909702","https://openalex.org/W2137370934","https://openalex.org/W2147368736","https://openalex.org/W2151033407","https://openalex.org/W2151670874","https://openalex.org/W2155627592","https://openalex.org/W2162284942","https://openalex.org/W2166521230","https://openalex.org/W2294348221","https://openalex.org/W2336123333","https://openalex.org/W2561675875","https://openalex.org/W2748837517","https://openalex.org/W2987907651","https://openalex.org/W3021915497","https://openalex.org/W3146075203","https://openalex.org/W4239007999","https://openalex.org/W4242057943","https://openalex.org/W4285719527","https://openalex.org/W6633342049","https://openalex.org/W6634622667"],"related_works":["https://openalex.org/W2192384867","https://openalex.org/W2108769896","https://openalex.org/W2171067235","https://openalex.org/W392685101","https://openalex.org/W2522490152","https://openalex.org/W190730148","https://openalex.org/W4306703214","https://openalex.org/W3193561143","https://openalex.org/W4390734126","https://openalex.org/W2964055444"],"abstract_inverted_index":{"We":[0,57,139,188,248],"propose":[1],"the":[2,70,81,86,103,151,169,200,251,260,264,272],"model":[3,229],"of":[4,9,21,24,33,73,76,144,157,165,171,175,194,198,216,231,267,276],"nested":[5,19,59,65,77,93,146,166,217,257,268],"words":[6,43,46,78,147,167,218],"for":[7,64,191],"representation":[8],"data":[10,25],"with":[11,26],"both":[12,45,52,282],"a":[13,17,203,213,221],"linear":[14,163],"ordering":[15],"and":[16,39,47,50,54,67,114,121,127,148,155,177,184,225,256,259,284,287,290],"hierarchically":[18],"matching":[20],"items.":[22],"Examples":[23],"such":[27],"dual":[28],"linear-hierarchical":[29],"structure":[30],"include":[31],"executions":[32],"structured":[34,195],"programs,":[35,196],"annotated":[36],"linguistic":[37],"data,":[38],"HTML/XML":[40],"documents.":[41],"Nested":[42],"generalize":[44],"ordered":[48,254],"trees,":[49],"allow":[51,228],"word":[53,60,89,94,269],"tree":[55,278,294],"operations.":[56],"define":[58],"automata":[61,95,270],"\u2014finite-state":[62],"acceptors":[63],"words,":[66,176,207,258],"show":[68,149],"that":[69,85,150,190,240,275],"resulting":[71],"class":[72,104,170,179],"regular":[74,88,142,214],"languages":[75,90,143,174,183],"has":[79],"all":[80,125],"appealing":[82],"theoretical":[83],"properties":[84,233],"classical":[87,277],"enjoys:":[91],"deterministic":[92,185],"are":[96,124,241],"as":[97,99,202,212,235,274],"expressive":[98],"their":[100],"nondeterministic":[101],"counterparts;":[102],"is":[105,271],"closed":[106],"under":[107],"union,":[108],"intersection,":[109],"complementation,":[110],"concatenation,":[111],"Kleene-*,":[112],"prefixes,":[113],"language":[115,119,122,205,215],"homomorphisms;":[116],"membership,":[117],"emptiness,":[118],"inclusion,":[120],"equivalence":[123],"decidable;":[126],"definability":[128],"in":[129,244],"monadic":[130],"second":[131],"order":[132],"logic":[133],"corresponds":[134],"exactly":[135],"to":[136],"finite-state":[137],"recognizability.":[138],"also":[140,249],"consider":[141],"infinite":[145],"closure":[152],"properties,":[153],"MSO-characterization,":[154],"decidability":[156],"decision":[158],"problems":[159],"carry":[160],"over.":[161],"The":[162],"encodings":[164],"give":[168],"visibly":[172,222],"pushdown":[173,223],"this":[178,226],"lies":[180],"between":[181,253],"balanced":[182],"context-free":[186,204],"languages.":[187],"argue":[189],"algorithmic":[192],"verification":[193],"instead":[197],"viewing":[199],"program":[201],"over":[206,293],"one":[208],"should":[209],"view":[210],"it":[211],"(or":[219],"equivalently,":[220],"language),":[224],"would":[227],"checking":[230],"many":[232],"(such":[234],"stack":[236],"inspection,":[237],"pre-post":[238],"conditions)":[239],"not":[242],"expressible":[243],"existing":[245],"specification":[246],"logics.":[247],"study":[250],"relationship":[252],"trees":[255],"corresponding":[261],"automata:":[262],"while":[263],"analysis":[265],"complexity":[266],"same":[273],"automata,":[279],"they":[280],"combine":[281],"bottom-up":[283],"top-down":[285],"traversals,":[286],"enjoy":[288],"expressiveness":[289],"succinctness":[291],"benefits":[292],"automata.":[295]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":30},{"year":2015,"cited_by_count":26},{"year":2014,"cited_by_count":30},{"year":2013,"cited_by_count":27},{"year":2012,"cited_by_count":26}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}