Context-free languages over infinite alphabets

被引：35
|
作者：
Cheng, EYC [1 ]
Kaminski, M
机构：
[1] Univ Florida, Dept Comp Sci & Informat Engn, Gainesville, FL 32611 USA
[2] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
[3] Hong Kong Univ Sci & Technol, Dept Comp Sci, Hong Kong, Peoples R China
来源：
ACTA INFORMATICA | 1998年 / 35卷 / 03期
关键词：
Natural Extension; Substantial Evidence; Closure Property; Pushdown Automaton; Infinite Alphabet;
D O I：
10.1007/s002360050120
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we introduce context-free grammars and pushdown automata over infinite alphabets. It is shown that a language is generated by a context-free grammar over an infinite alphabet if and only if it is accepted by a pushdown automaton over an infinite alphabet. Also the generated (accepted) languages possess many of the properties of the ordinary context-free languages: decidability, closure properties, etc.. This provides a substantial evidence for considering context-free grammars and pushdown automata over infinite alphabets as a natural extension of the classical ones.
引用
收藏
页码：245 / 267
页数：23
相关论文
共 50 条
  • [21] ON THE RECOGNITION OF CONTEXT-FREE LANGUAGES
    RYTTER, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 208 : 318 - 325
  • [22] CONTEXT-FREE AND STATIONARY LANGUAGES
    THIERRIN, G
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1979, 7 (04) : 297 - 301
  • [23] CONTEXT-FREE FUZZY LANGUAGES
    SANTOS, ES
    INFORMATION AND CONTROL, 1974, 26 (01): : 1 - 11
  • [24] Logics for context-free languages
    Lautemann, C
    Schwentick, T
    Therien, D
    COMPUTER SCIENCE LOGIC, 1995, 933 : 205 - 216
  • [25] ON REGULARITY OF CONTEXT-FREE LANGUAGES
    EHRENFEUCHT, A
    HAUSSLER, D
    ROZENBERG, G
    THEORETICAL COMPUTER SCIENCE, 1983, 27 (03) : 311 - 332
  • [26] CATERPILLARS AND CONTEXT-FREE LANGUAGES
    CHYTIL, MP
    MONIEN, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 415 : 70 - 81
  • [27] QUOTIENTS OF CONTEXT-FREE LANGUAGES
    GINSBURG, S
    SPANIER, EH
    JOURNAL OF THE ACM, 1963, 10 (04) : 487 - &
  • [28] Characterization of context-free languages
    Badano, M.
    Vaggione, D.
    THEORETICAL COMPUTER SCIENCE, 2017, 676 : 92 - 96
  • [29] CHARACTERIZATION OF CONTEXT-FREE LANGUAGES
    DEGALLEGO, MS
    ANNALES DE LA SOCIETE SCIENTIFIQUE DE BRUXELLES SERIES 1-SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1979, 93 (03): : 155 - 158
  • [30] On polyslender context-free languages
    Dömösi, P
    Martin-Vide, C
    Mateescu, A
    PUBLICATIONES MATHEMATICAE-DEBRECEN, 2005, 66 (1-2): : 1 - 15
12345