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 条
  • [31] Buchi context-free languages
    Esik, Zoltan
    Ivan, Szabolcs
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (8-10) : 805 - 821
  • [32] PARALLEL CONTEXT-FREE LANGUAGES
    SIROMONEY, R
    KRITHIVASAN, K
    INFORMATION AND CONTROL, 1974, 24 (02): : 155 - 162
  • [33] Kernels of Context-Free Languages
    Kutrib, Martin
    Prigioniero, Luca
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
  • [34] Superwords and context-free languages
    Dömösi, P
    PUBLICATIONES MATHEMATICAE-DEBRECEN, 2000, 56 (3-4): : 313 - 320
  • [35] A NOTE ON CONTEXT-FREE LANGUAGES
    WALTERS, RFC
    JOURNAL OF PURE AND APPLIED ALGEBRA, 1989, 62 (02) : 199 - 203
  • [36] Efficient recognition algorithms for parallel multiple context-free languages and for multiple context-free languages
    Nakanishi, R
    Takada, K
    Nii, H
    Seki, H
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1998, E81D (11) : 1148 - 1161
  • [38] A NOTE ON AMBIGUITY IN CONTEXT-FREE GRAMMARS
    ALTMAN, T
    LOGOTHETIS, G
    INFORMATION PROCESSING LETTERS, 1990, 35 (03) : 111 - 114
  • [39] Analyzing ambiguity of context-free grammars
    Brabrand, Claus
    Giegerich, Robert
    Moller, Anders
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2007, 4783 : 214 - +
  • [40] Analyzing ambiguity of context-free grammars
    Brabrand, Claus
    Giegerich, Robert
    Moller, Anders
    SCIENCE OF COMPUTER PROGRAMMING, 2010, 75 (03) : 176 - 191