{"id":"https://openalex.org/W2167047250","doi":"https://doi.org/10.1080/00207169708804609","title":"Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages","display_name":"Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2167047250","doi":"https://doi.org/10.1080/00207169708804609","mag":"2167047250"},"language":"en","primary_location":{"id":"doi:10.1080/00207169708804609","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169708804609","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":["Computing Center , Technical University of Brno , Udolni 19, Brno, 60200,  Czech Republic"],"affiliations":[{"raw_affiliation_string":"Computing Center , Technical University of Brno , Udolni 19, Brno, 60200,  Czech Republic","institution_ids":["https://openalex.org/I60587646"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009693719"],"corresponding_institution_ids":["https://openalex.org/I60587646"],"apc_list":null,"apc_paid":null,"fwci":1.0048,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78157744,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"65","issue":"3-4","first_page":"179","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9887999892234802,"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.9887999892234802,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9711999893188477,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9298999905586243,"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/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.9473065137863159},{"id":"https://openalex.org/keywords/terminal-and-nonterminal-symbols","display_name":"Terminal and nonterminal symbols","score":0.9345293045043945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.620047926902771},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.6045685410499573},{"id":"https://openalex.org/keywords/indexed-grammar","display_name":"Indexed grammar","score":0.5618011355400085},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.4296850264072418},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.4264400899410248},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4115297496318817},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.4090084731578827},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3599444031715393},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19820129871368408}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.9473065137863159},{"id":"https://openalex.org/C9432014","wikidata":"https://www.wikidata.org/wiki/Q954063","display_name":"Terminal and nonterminal symbols","level":3,"score":0.9345293045043945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.620047926902771},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.6045685410499573},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.5618011355400085},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.4296850264072418},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.4264400899410248},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4115297496318817},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.4090084731578827},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3599444031715393},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19820129871368408}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169708804609","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169708804609","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":[{"id":"https://metadata.un.org/sdg/4","score":0.8100000023841858,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W112931193","https://openalex.org/W1515624550","https://openalex.org/W2062841770","https://openalex.org/W2074869001","https://openalex.org/W4245660582","https://openalex.org/W4250138376"],"related_works":["https://openalex.org/W2070647957","https://openalex.org/W13148084","https://openalex.org/W2885479591","https://openalex.org/W1995994566","https://openalex.org/W1999932874","https://openalex.org/W1598149724","https://openalex.org/W3044192055","https://openalex.org/W4256356181","https://openalex.org/W2049140374","https://openalex.org/W2490154515"],"abstract_inverted_index":{"The":[0],"present":[1],"paper":[2],"investigates":[3],"the":[4,13,21],"descriptional":[5],"complexity":[6],"of":[7,15,23],"multi-sequential":[8,31],"grammars":[9],"with":[10],"respect":[11],"to":[12],"number":[14],"nonterminals.":[16],"This":[17],"investigation":[18],"demonstrates":[19],"that":[20],"family":[22],"recursively":[24],"enumerable":[25],"languages":[26],"is":[27],"characterized":[28],"by":[29],"six-nonterminal":[30],"grammars.":[32]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}