{"id":"https://openalex.org/W4401305178","doi":"https://doi.org/10.1016/j.tcs.2024.114763","title":"On the power of local graph expansion grammars with and without additional restrictions","display_name":"On the power of local graph expansion grammars with and without additional restrictions","publication_year":2024,"publication_date":"2024-08-03","ids":{"openalex":"https://openalex.org/W4401305178","doi":"https://doi.org/10.1016/j.tcs.2024.114763"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2024.114763","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2024.114763","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2024.114763","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002462356","display_name":"Frank Drewes","orcid":"https://orcid.org/0000-0001-7349-7693"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Frank Drewes","raw_affiliation_strings":["Ume\u00e5 University, Department of Computing Science, Ume\u00e5, 90187, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-7349-7693","affiliations":[{"raw_affiliation_string":"Ume\u00e5 University, Department of Computing Science, Ume\u00e5, 90187, Sweden","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092530349","display_name":"Yannick Stade","orcid":"https://orcid.org/0000-0001-5785-2528"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yannick Stade","raw_affiliation_strings":["Technical University of Munich, TUM School of Computation, Information and Technology, Arcisstra\u00dfe 21, Munich, 80333, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5785-2528","affiliations":[{"raw_affiliation_string":"Technical University of Munich, TUM School of Computation, Information and Technology, Arcisstra\u00dfe 21, Munich, 80333, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002462356"],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.14631039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1015","issue":null,"first_page":"114763","last_page":"114763"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9965999722480774,"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.9965999722480774,"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.9937999844551086,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9934999942779541,"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/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.5615555047988892},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5391190052032471},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4724688231945038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45702171325683594},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.45418938994407654},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.44271719455718994},{"id":"https://openalex.org/keywords/pumping-lemma-for-regular-languages","display_name":"Pumping lemma for regular languages","score":0.4366065561771393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4363754987716675},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.3752343952655792},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3257308006286621},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.31813275814056396},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.28190672397613525},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.27457621693611145},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24165800213813782},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.16423064470291138},{"id":"https://openalex.org/keywords/fifth-generation-programming-language","display_name":"Fifth-generation programming language","score":0.08638882637023926}],"concepts":[{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.5615555047988892},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5391190052032471},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4724688231945038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45702171325683594},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.45418938994407654},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.44271719455718994},{"id":"https://openalex.org/C157968401","wikidata":"https://www.wikidata.org/wiki/Q2292874","display_name":"Pumping lemma for regular languages","level":5,"score":0.4366065561771393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4363754987716675},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.3752343952655792},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3257308006286621},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.31813275814056396},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28190672397613525},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.27457621693611145},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24165800213813782},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.16423064470291138},{"id":"https://openalex.org/C199305712","wikidata":"https://www.wikidata.org/wiki/Q3205914","display_name":"Fifth-generation programming language","level":3,"score":0.08638882637023926},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.0},{"id":"https://openalex.org/C11164408","wikidata":"https://www.wikidata.org/wiki/Q18657800","display_name":"Second-generation programming language","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.tcs.2024.114763","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2024.114763","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:umu-228142","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-228142","pdf_url":"https://umu.diva-portal.org/smash/get/diva2:1886514/FULLTEXT01","source":{"id":"https://openalex.org/S4306400361","display_name":"DiVA at Ume\u00e5 University (Ume\u00e5 University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I90267481","host_organization_name":"Ume\u00e5 University","host_organization_lineage":["https://openalex.org/I90267481"],"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":"","raw_type":"Article in journal"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2024.114763","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2024.114763","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322327","display_name":"Knut och Alice Wallenbergs Stiftelse","ror":"https://ror.org/004hzzk67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W127565347","https://openalex.org/W1461730999","https://openalex.org/W1512428151","https://openalex.org/W1514893137","https://openalex.org/W1523742478","https://openalex.org/W1623604111","https://openalex.org/W1665726835","https://openalex.org/W1972434646","https://openalex.org/W2016113382","https://openalex.org/W2028357390","https://openalex.org/W2050407768","https://openalex.org/W2060300993","https://openalex.org/W2065255929","https://openalex.org/W2240941585","https://openalex.org/W2774310971","https://openalex.org/W4298311512","https://openalex.org/W4383533168","https://openalex.org/W6628605823","https://openalex.org/W6630549541","https://openalex.org/W6630662865","https://openalex.org/W6631593900","https://openalex.org/W6636171814","https://openalex.org/W6636343575","https://openalex.org/W6643427025","https://openalex.org/W6688953900","https://openalex.org/W6690422063","https://openalex.org/W6744604819","https://openalex.org/W6764861208","https://openalex.org/W6796879627","https://openalex.org/W6839997824","https://openalex.org/W6856719794"],"related_works":["https://openalex.org/W1534696515","https://openalex.org/W1576087595","https://openalex.org/W2096529162","https://openalex.org/W2403839235","https://openalex.org/W2002874795","https://openalex.org/W1994753582","https://openalex.org/W1491614438","https://openalex.org/W1504521618","https://openalex.org/W79047183","https://openalex.org/W2045677144"],"abstract_inverted_index":{"We":[0],"study":[1,98],"graph":[2,8,39,88,104],"expansion":[3,22,77,83,89,105],"grammars,":[4],"a":[5,70,85,124,140],"type":[6],"of":[7,41,47,56,60,87,102],"grammar":[9],"that":[10,91,120,129],"has":[11],"recently":[12],"been":[13],"introduced":[14],"with":[15],"motivations":[16],"in":[17],"natural":[18,118],"language":[19],"processing.":[20],"Graph":[21],"generalizes":[23],"the":[24,31,33,45,54,57,61,66,99,130],"well-known":[25],"hyperedge":[26],"replacement.":[27],"In":[28,50],"contrast":[29],"to":[30,37,112,123],"latter,":[32],"former":[34],"is":[35],"able":[36,111],"generate":[38],"languages":[40,63,132,136],"unbounded":[42],"treewidth,":[43],"like":[44],"set":[46],"all":[48],"graphs.":[49,95],"an":[51],"earlier":[52],"paper,":[53],"complexity":[55],"membership":[58],"problem":[59],"generated":[62,131],"was":[64],"studied,":[65],"main":[67],"result":[68],"being":[69],"polynomial":[71],"parsing":[72],"algorithm":[73],"for":[74],"local":[75,81,103],"DAG":[76,82],"grammars":[78,90],"(there":[79],"called":[80],"grammars),":[84],"subclass":[86],"generates":[92],"directed":[93],"acyclic":[94],"Here,":[96],"we":[97,116],"generative":[100],"power":[101],"grammars.":[106],"While":[107],"they,":[108],"unrestricted,":[109],"are":[110],"simulate":[113],"Turing":[114],"machines,":[115],"identify":[117],"restrictions":[119],"give":[121],"rise":[122],"pumping":[125],"lemma":[126],"and":[127],"ensure":[128],"have":[133],"regular":[134],"path":[135],"as":[137,139],"well":[138],"semi-linear":[141],"Parikh":[142],"image.":[143]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}