{"id":"https://openalex.org/W1821045612","doi":"https://doi.org/10.1007/3-540-57182-5_41","title":"Some hierarchies for the communication complexity measures of cooperating grammar systems","display_name":"Some hierarchies for the communication complexity measures of cooperating grammar systems","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W1821045612","doi":"https://doi.org/10.1007/3-540-57182-5_41","mag":"1821045612"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-57182-5_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57182-5_41","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5088678782","display_name":"Juraj Hromkovi\u010d","orcid":"https://orcid.org/0000-0001-9754-7042"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Juraj Hromkovic","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Paderborn, 4790, Paderborn, Germany","University of Paderborn >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Paderborn, 4790, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"University of Paderborn >  >  >  >","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057995798","display_name":"Jarkko Kari","orcid":"https://orcid.org/0000-0003-0670-6138"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]},{"id":"https://openalex.org/I112281704","display_name":"Research Council of Finland","ror":"https://ror.org/05k73zm37","country_code":"FI","type":"government","lineage":["https://openalex.org/I112281704"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Jarkko Kari","raw_affiliation_strings":["Academy of Finland and Department of Mathematics, University of Turku, 20500, Turku, Finland","University of turku;"],"affiliations":[{"raw_affiliation_string":"Academy of Finland and Department of Mathematics, University of Turku, 20500, Turku, Finland","institution_ids":["https://openalex.org/I112281704","https://openalex.org/I155660961"]},{"raw_affiliation_string":"University of turku;","institution_ids":["https://openalex.org/I155660961"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041517753","display_name":"Lila Kari","orcid":"https://orcid.org/0000-0001-5700-5353"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]},{"id":"https://openalex.org/I112281704","display_name":"Research Council of Finland","ror":"https://ror.org/05k73zm37","country_code":"FI","type":"government","lineage":["https://openalex.org/I112281704"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Lila Kari","raw_affiliation_strings":["Academy of Finland and Department of Mathematics, University of Turku, 20500, Turku, Finland","University of turku;"],"affiliations":[{"raw_affiliation_string":"Academy of Finland and Department of Mathematics, University of Turku, 20500, Turku, Finland","institution_ids":["https://openalex.org/I112281704","https://openalex.org/I155660961"]},{"raw_affiliation_string":"University of turku;","institution_ids":["https://openalex.org/I155660961"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088678782"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1251,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78406412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"495","last_page":"505"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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.9998999834060669,"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.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9972000122070312,"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/computer-science","display_name":"Computer science","score":0.7424439191818237},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7187541723251343},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5746789574623108},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5427175164222717},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.5163778066635132},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.51084965467453},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.4920320212841034},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4724743068218231},{"id":"https://openalex.org/keywords/formal-language","display_name":"Formal language","score":0.47219857573509216},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.4550401568412781},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3237307667732239},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2605351507663727},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.08678919076919556}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7424439191818237},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7187541723251343},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5746789574623108},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5427175164222717},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.5163778066635132},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.51084965467453},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.4920320212841034},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4724743068218231},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.47219857573509216},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.4550401568412781},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3237307667732239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2605351507663727},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.08678919076919556},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-57182-5_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57182-5_41","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.4499","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4499","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csd.uwo.ca/faculty/lila/pdfs/Some hierarchies for the communication complexity measures ofcooperating grammar systems.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1577059114","https://openalex.org/W1992797704","https://openalex.org/W1994106878","https://openalex.org/W2002128188","https://openalex.org/W2041694802","https://openalex.org/W2110425399","https://openalex.org/W2395319881","https://openalex.org/W2401699795","https://openalex.org/W2406965101","https://openalex.org/W2914032487","https://openalex.org/W4211008702","https://openalex.org/W6759367340"],"related_works":["https://openalex.org/W2374430960","https://openalex.org/W2327776271","https://openalex.org/W1512399864","https://openalex.org/W1968633117","https://openalex.org/W342214647","https://openalex.org/W1539117866","https://openalex.org/W2041069649","https://openalex.org/W1548964214","https://openalex.org/W94369263","https://openalex.org/W4387560420"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}