{"id":"https://openalex.org/W2522877794","doi":"https://doi.org/10.1142/s0129626416500122","title":"Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space","display_name":"Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2522877794","doi":"https://doi.org/10.1142/s0129626416500122","mag":"2522877794"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626416500122","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626416500122","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5022137616","display_name":"Stefan D. Bruda","orcid":null},"institutions":[{"id":"https://openalex.org/I113281461","display_name":"Bishop's University","ror":"https://ror.org/051prj435","country_code":"CA","type":"education","lineage":["https://openalex.org/I113281461"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stefan D. Bruda","raw_affiliation_strings":["Department of Computer Science, Bishop\u2019s University 2600 College St, Sherbrooke, Quebec J1M 1Z7, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bishop\u2019s University 2600 College St, Sherbrooke, Quebec J1M 1Z7, Canada","institution_ids":["https://openalex.org/I113281461"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088249284","display_name":"Mary Sarah Ruth Wilkin","orcid":null},"institutions":[{"id":"https://openalex.org/I113281461","display_name":"Bishop's University","ror":"https://ror.org/051prj435","country_code":"CA","type":"education","lineage":["https://openalex.org/I113281461"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mary Sarah Ruth Wilkin","raw_affiliation_strings":["Department of Computer Science, Bishop\u2019s University 2600 College St, Sherbrooke, Quebec J1M 1Z7, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bishop\u2019s University 2600 College St, Sherbrooke, Quebec J1M 1Z7, Canada","institution_ids":["https://openalex.org/I113281461"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I113281461"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07300221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":"03","first_page":"1650012","last_page":"1650012"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"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/T11567","display_name":"semigroups and automata theory","score":0.9980999827384949,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9973000288009644,"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.7958301305770874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.626509428024292},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5695578455924988},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5142616629600525},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.5119067430496216},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.49437475204467773},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.4732323884963989},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44898656010627747},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.37487494945526123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3682399392127991},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18386349081993103},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.164883553981781},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.1140112578868866}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7958301305770874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.626509428024292},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5695578455924988},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5142616629600525},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.5119067430496216},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.49437475204467773},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.4732323884963989},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44898656010627747},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.37487494945526123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3682399392127991},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18386349081993103},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.164883553981781},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.1140112578868866},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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.1142/s0129626416500122","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626416500122","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1977952029","https://openalex.org/W1995375035","https://openalex.org/W2001356001","https://openalex.org/W2049848227","https://openalex.org/W2052391311","https://openalex.org/W2092508863","https://openalex.org/W2335502549","https://openalex.org/W2963541987","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1557335907","https://openalex.org/W4286266684","https://openalex.org/W1586408085","https://openalex.org/W1538450113","https://openalex.org/W1656514314","https://openalex.org/W4245826738","https://openalex.org/W3013382169","https://openalex.org/W281298494","https://openalex.org/W2389079996","https://openalex.org/W2041624339"],"abstract_inverted_index":{"Coverability":[0],"trees":[1,49,107,114],"offer":[2],"a":[3,11],"finite":[4,18],"characterization":[5],"of":[6,10,41,74],"all":[7,40],"the":[8,33,42,65,72,124],"derivations":[9],"context-free":[12],"parallel":[13],"grammar":[14],"system":[15],"(CF-PCGS).":[16],"Their":[17],"nature":[19],"implies":[20],"that":[21,32,67,89,101,111],"they":[22],"necessarily":[23],"omit":[24],"some":[25],"information":[26,35,121],"about":[27],"these":[28],"derivations.":[29],"We":[30,80],"demonstrate":[31],"omitted":[34],"is":[36],"most":[37],"if":[38],"not":[39,51,116],"time":[43],"too":[44],"much,":[45],"and":[46],"so":[47],"coverability":[48,106,113],"are":[50,92],"useful":[52],"as":[53],"an":[54,86],"analysis":[55],"tool":[56],"except":[57],"for":[58,108],"their":[59],"limited":[60],"use":[61],"already":[62],"considered":[63],"in":[64,117],"paper":[66],"introduces":[68],"them":[69],"(namely,":[70],"determining":[71],"decidability":[73],"certain":[75],"decision":[76],"problems":[77],"over":[78],"PCGS).":[79],"establish":[81],"this":[82,102],"result":[83],"by":[84],"invalidating":[85],"existing":[87],"proof":[88,103],"synchronized":[90],"CF-PCGS":[91],"less":[93],"expressive":[94],"than":[95],"context-sensitive":[96],"grammars.":[97],"Indeed,":[98],"we":[99],"discover":[100],"relies":[104],"on":[105],"CF-PCGS,":[109],"but":[110],"such":[112],"do":[115],"fact":[118],"contain":[119],"enough":[120],"to":[122],"support":[123],"proof.":[125]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}