On ambiguity in internal contextual languages

被引：0
|
作者：
Ilie, L [1 ]
机构：
[1] Ctr Comp Sci, FIN-20520 Turku, Finland
来源：
MATHEMATICAL AND COMPUTATIONAL ANALYSIS OF NATURAL LANGUAGE | 1998年 / 45卷
关键词：
D O I：
暂无
中图分类号：
H [语言、文字];
学科分类号：
05 ;
摘要：
Several types of ambiguity in internal contextual languages have already been introduced. We define a new natural type and investigate all types here, mainly in connection with determinism, contextual grammars without choice, and grammars over one-letter alphabets. Several open problems are also formulated.
引用
收藏
页码：29 / 45
页数：17
相关论文
共 50 条
  • [1] Attempting to define the ambiguity of internal contextual languages
    Martín-Vide, C
    Miquel-Vergés, J
    Paun, G
    Salomaa, A
    MATHEMATICAL AND COMPUTATIONAL ANALYSIS OF NATURAL LANGUAGE, 1998, 45 : 59 - 81
  • [2] LANGFORD STRINGS, FORMAL LANGUAGES AND CONTEXTUAL AMBIGUITY
    MARCUS, S
    PAUN, G
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1989, 26 (3-4) : 179 - 191
  • [3] A note on ambiguity of internal contextual grammars
    Kuppusamy, Lakshmanan
    THEORETICAL COMPUTER SCIENCE, 2006, 369 (1-3) : 436 - 441
  • [4] On representing recursively enumerable languages by internal contextual languages
    Ehrenfeucht, A
    Paun, G
    Rozenberg, G
    THEORETICAL COMPUTER SCIENCE, 1998, 205 (1-2) : 61 - 83
  • [5] Characterizations of RE languages starting from internal contextual languages
    Mateescu, A
    Paun, GH
    Rozenberg, G
    Salomaa, A
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1998, 66 (3-4) : 179 - 197
  • [6] Characterizations of re languages starting from internal contextual languages
    Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109 Bucureşti, Romania
    不详
    不详
    不详
    不详
    Int J Comput Math, 3-4 (179-197):
  • [7] On the Trade-off Between Ambiguity and Complexity in Contextual Languages
    Kuppusamy, Lakshmanan
    Mahendran, Anand
    Krithivasan, Kamala
    FUNDAMENTA INFORMATICAE, 2013, 122 (04) : 315 - 326
  • [8] On Internal Contextual Grammars with Subregular Selection Languages
    Manea, Florin
    Truthe, Bianca
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2012, 2012, 7386 : 222 - 235
  • [9] The syntactic complexity of internal contextual grammars and languages
    Georgescu, G
    MATHEMATICAL AND COMPUTATIONAL ANALYSIS OF NATURAL LANGUAGE, 1998, 45 : 17 - 28
  • [10] Further results on syntactic ambiguity of internal contextual grammars
    Kuppusamy, Lakshmanan
    Finite-State Methods and Natural Language Processing, 2006, 4002 : 132 - 143
12345