A CLASS OF CONTEXT-FREE GRAMMARS WHICH GENERATE DETERMINISTIC LANGUAGE

被引：0
|
作者：
TOKURA, N
KASAMI, T
机构：
来源：
ELECTRONICS & COMMUNICATIONS IN JAPAN | 1968年 / 51卷 / 08期
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
引用
收藏
页码：148 / &
相关论文
共 50 条
  • [1] Context-Free Grammars for Deterministic Regular Expressions with Interleaving
    Mou, Xiaoying
    Chen, Haiming
    Li, Yeting
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2019, 2019, 11884 : 235 - 252
  • [2] Generalized context-free grammars and multiple context-free grammars
    Kasami, Tadao
    Seki, Hiroyuki
    Fujii, Mamoru
    Systems and Computers in Japan, 1989, 20 (07): : 43 - 52
  • [3] Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
    Drewes, Frank
    Engelfriett, Joost
    ACTA CYBERNETICA, 2015, 22 (02): : 373 - 392
  • [4] LANGUAGE MODELING USING STOCHASTIC CONTEXT-FREE GRAMMARS
    CORAZZA, A
    DEMORI, R
    GRETTER, R
    SATTA, G
    SPEECH COMMUNICATION, 1993, 13 (1-2) : 163 - 170
  • [5] REDUCTION OF CONTEXT-FREE GRAMMARS
    TANIGUCHI, K
    KASAMI, T
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1969, 52 (12): : 204 - +
  • [6] CONTEXT-FREE GRAMMARS WITH MEMORY
    MORIYA, E
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1992, E75D (06) : 847 - 851
  • [7] On translating context-free grammars into Lambek grammars
    S. L. Kuznetsov
    Proceedings of the Steklov Institute of Mathematics, 2015, 290 : 63 - 69
  • [8] Context-Free Categorical Grammars
    Bauderon, Michel
    Chen, Rui
    Ly, Olivier
    ALGEBRAIC INFORMATICS, 2009, 5725 : 160 - +
  • [9] REDUCTION OF CONTEXT-FREE GRAMMARS
    TANIGUCHI, K
    KASAMI, T
    INFORMATION AND CONTROL, 1970, 17 (01): : 92 - +
  • [10] RELATEDNESS OF CONTEXT-FREE GRAMMARS
    WALTER, HKG
    COMPUTING, 1979, 22 (01) : 31 - 58
12345