DOMINATIONAL AMBIGUITY OF CONTEXT-FREE LANGUAGES.

被引：0
|
作者：
Modina, L.S.
机构：
来源：
| 1978年 / 14卷 / 02期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
So-called generalized tree domination grammars that assign subordination trees to the generated strings are considered. It is shown that the class of languages generated by unambiguous generalized tree domination grammars (i. e. , grammars that associate a unique subordination tree with each generated string), are strictly intermediate between the classes of unambiguous CF-languages and all CF-languages.
引用
收藏
页码：138 / 147
相关论文
共 50 条
12345