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 条
  • [31] On strongly context-free languages
    Ilie, L
    Paun, G
    Rozenberg, G
    Salomaa, A
    DISCRETE APPLIED MATHEMATICS, 2000, 103 (1-3) : 153 - 165
  • [32] BICENTERS OF CONTEXT-FREE LANGUAGES
    AUTEBERT, JM
    BEAUQUIER, J
    BOASSON, L
    GIRE, F
    ACTA INFORMATICA, 1984, 21 (02) : 209 - 227
  • [33] ERASABLE CONTEXT-FREE LANGUAGES
    GREIBACH, SA
    INFORMATION AND CONTROL, 1975, 29 (04): : 301 - 326
  • [34] STOCHASTIC CONTEXT-FREE LANGUAGES
    HUANG, T
    FU, KS
    INFORMATION SCIENCES, 1971, 3 (03) : 201 - &
  • [35] ON COMMUTATIVE CONTEXT-FREE LANGUAGES
    BEAUQUIER, J
    BLATTNER, M
    LATTEUX, M
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1987, 35 (03) : 311 - 320
  • [36] TRANSFORMATIONS IN CONTEXT-FREE LANGUAGES
    RADENSKY, AA
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1983, 36 (02): : 185 - 187
  • [37] Buchi context-free languages
    Esik, Zoltan
    Ivan, Szabolcs
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (8-10) : 805 - 821
  • [38] PARALLEL CONTEXT-FREE LANGUAGES
    SIROMONEY, R
    KRITHIVASAN, K
    INFORMATION AND CONTROL, 1974, 24 (02): : 155 - 162
  • [39] Kernels of Context-Free Languages
    Kutrib, Martin
    Prigioniero, Luca
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024,
  • [40] Superwords and context-free languages
    Dömösi, P
    PUBLICATIONES MATHEMATICAE-DEBRECEN, 2000, 56 (3-4): : 313 - 320
12345