{"id":"https://openalex.org/W2165405772","doi":"https://doi.org/10.1080/00207160304666","title":"Descriptional Complexity Of Generalized Forbidding Grammars","display_name":"Descriptional Complexity Of Generalized Forbidding Grammars","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2165405772","doi":"https://doi.org/10.1080/00207160304666","mag":"2165405772"},"language":"en","primary_location":{"id":"doi:10.1080/00207160304666","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160304666","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5009693719","display_name":"Alexander Meduna","orcid":"https://orcid.org/0000-0002-2341-0606"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Alexander Meduna","raw_affiliation_strings":["Faculty of Information Technology, Department of Information Systems , Brno University of Technology , Bo\u017eet\u011bchova 2, Brno, 61266, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Department of Information Systems , Brno University of Technology , Bo\u017eet\u011bchova 2, Brno, 61266, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014684485","display_name":"Martin \u0160vec","orcid":"https://orcid.org/0000-0003-3198-3356"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Martin \u0160vec","raw_affiliation_strings":["Faculty of Information Technology, Department of Information Systems , Brno University of Technology , Bo\u017eet\u011bchova 2, Brno, 61266, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Department of Information Systems , Brno University of Technology , Bo\u017eet\u011bchova 2, Brno, 61266, Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009693719"],"corresponding_institution_ids":["https://openalex.org/I60587646"],"apc_list":null,"apc_paid":null,"fwci":0.222,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.53267278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"80","issue":"1","first_page":"11","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11567","display_name":"semigroups and automata theory","score":0.9986000061035156,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9973000288009644,"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/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6358745098114014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5691682696342468},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3310502767562866},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.1792723536491394}],"concepts":[{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6358745098114014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5691682696342468},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3310502767562866},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.1792723536491394}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160304666","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160304666","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W143770919","https://openalex.org/W164542598","https://openalex.org/W189798146","https://openalex.org/W1481313699","https://openalex.org/W1483216668","https://openalex.org/W1515624550","https://openalex.org/W1584587517","https://openalex.org/W1588750390","https://openalex.org/W1977268879","https://openalex.org/W2068931825","https://openalex.org/W2475476206"],"related_works":["https://openalex.org/W1997090502","https://openalex.org/W3095893476","https://openalex.org/W2141137168","https://openalex.org/W2952183208","https://openalex.org/W1513084280","https://openalex.org/W92795209","https://openalex.org/W1974878518","https://openalex.org/W2099269319","https://openalex.org/W4245313431","https://openalex.org/W3147354785"],"abstract_inverted_index":{"This":[0],"paper":[1],"discusses":[2],"the":[3],"descriptional":[4],"complexity":[5],"of":[6],"generalized":[7,21],"forbidding":[8,22,29],"grammars.":[9],"It":[10],"proves":[11],"that":[12],"every":[13],"recursively":[14],"enumerable":[15],"language":[16],"is":[17],"generated":[18],"by":[19],"a":[20],"grammar":[23],"containing":[24],"no":[25,32],"more":[26,33],"than":[27,34],"thirteen":[28],"productions":[30],"and":[31],"fifteen":[35],"nonterminals.":[36]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}