One-sided random context grammars with a limited number of right random context rules

被引：3
|
作者：
Meduna, Alexander [1 ]
Zemek, Petr [1 ]
机构：
[1] Brno Univ Technol, Fac Informat Technol, IT4Innovat Ctr Excellence, Dept Informat Syst, Brno 61266, Czech Republic
来源：
THEORETICAL COMPUTER SCIENCE | 2014年 / 516卷
关键词：
Formal languages; One-sided random context grammars; Right random context rules; Reduction;
D O I：
10.1016/j.tcs.2013.11.009
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper deals with regulated grammars. Specifically, it studies one-sided random context grammars. It demonstrates that any recursively enumerable language can be generated by these grammars with no more than two right random context rules. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：127 / 132
页数：6
相关论文
共 50 条
12345