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 条
  • [1] Context-free languages over infinite alphabets
    Edward Y.C. Cheng
    Michael Kaminski
    Acta Informatica, 1998, 35 : 245 - 267
  • [2] CLASSES OF REGULAR AND CONTEXT-FREE LANGUAGES OVER COUNTABLY INFINITE ALPHABETS
    OTTO, F
    DISCRETE APPLIED MATHEMATICS, 1985, 12 (01) : 41 - 56
  • [3] Identification of Substitutable Context-Free Languages over Infinite Alphabets from Positive Data
    Numaya, Yutaro
    Hendrian, Diptarama
    Yoshinaka, Ryo
    Shinohara, Ayumi
    INTERNATIONAL CONFERENCE ON GRAMMATICAL INFERENCE, VOL 217, 2023, 217 : 23 - 34
  • [4] Context-@free languages over infinite alphabets
    Acta Inf, 3 (245):
  • [5] Regular and Context-Free Pattern Languages over Small Alphabets
    Reidenbach, Daniel
    Schmid, Markus L.
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 130 - 141
  • [6] Regular and context-free pattern languages over small alphabets
    Reidenbach, Daniel
    Schmid, Markus L.
    THEORETICAL COMPUTER SCIENCE, 2014, 518 : 80 - 95
  • [7] AN INFINITE HIERARCHY OF CONTEXT-FREE LANGUAGES
    GREIBACH, SA
    JOURNAL OF THE ACM, 1969, 16 (01) : 91 - &
  • [8] RAAM for infinite context-free languages
    Melnik, O
    Levy, S
    Pollack, J
    IJCNN 2000: PROCEEDINGS OF THE IEEE-INNS-ENNS INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOL V, 2000, : 585 - 590
  • [9] HIERARCHIES OVER THE CONTEXT-FREE LANGUAGES
    REINHARDT, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 464 : 214 - 224
  • [10] LANGUAGES OVER INFINITE ALPHABETS
    AUTEBERT, JM
    BEAUQUIER, J
    BOASSON, L
    DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 1 - 20
12345