A PUSHDOWN AUTOMATON OR A CONTEXT-FREE GRAMMAR - WHICH IS MORE ECONOMICAL

被引:14
|
作者
GOLDSTINE, J
PRICE, JK
WOTSCHKE, D
机构
关键词
D O I
10.1016/0304-3975(82)90110-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:33 / 40
页数:8
相关论文
共 50 条
  • [1] A context-free process as a pushdown automaton
    Baeten, J. C. M.
    Cuijpers, P. J. L.
    van Tilburg, P. J. A.
    CONCUR 2008 - CONCURRENCY THEORY, PROCEEDINGS, 2008, 5201 : 98 - 113
  • [2] FAST RECOGNITION OF PUSHDOWN AUTOMATON AND CONTEXT-FREE LANGUAGES
    RYTTER, W
    INFORMATION AND CONTROL, 1985, 67 (1-3): : 12 - 22
  • [4] FAST RECOGNITION OF PUSHDOWN AUTOMATON AND CONTEXT-FREE LANGUAGES.
    Rytter, Wojciech
    Information and control, 1984, 67 (1-3):
  • [5] CONTEXT-FREE LANGUAGE WHICH IS NOT ACCEPTABLE BY A PROBABILISTIC AUTOMATON
    NASU, M
    HONDA, N
    INFORMATION AND CONTROL, 1971, 18 (03): : 233 - &
  • [6] Approximate matching between a context-free grammar and a finite-state automaton
    Ko, Sang-Ki
    Han, Yo-Sub
    Salomaa, Kai
    INFORMATION AND COMPUTATION, 2016, 247 : 278 - 289
  • [7] UNIVERSAL CONTEXT-FREE GRAMMAR
    KASAI, T
    INFORMATION AND CONTROL, 1975, 28 (01): : 30 - 34
  • [8] CONTEXT-FREE GRAMMAR FORMS
    CREMERS, A
    GINSBURG, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 11 (01) : 86 - 117
  • [9] Parallel Contextual Array Insertion Deletion Grammar and (Context-Free : Context-Free) Matrix Grammar
    Jayasankar, S.
    Thomas, D. G.
    Immanuel, S. James
    Paramasivan, Meenakshi
    Robinson, T.
    Nagar, Atulya K.
    COMBINATORIAL IMAGE ANALYSIS, IWCIA 2020, 2020, 12148 : 147 - 163
  • [10] Grammar compression with probabilistic context-free grammar
    Naganuma, Hiroaki
    Hendrian, Diptarama
    Yoshinaka, Ryo
    Shinohara, Ayumi
    Kobayashi, Naoki
    2020 DATA COMPRESSION CONFERENCE (DCC 2020), 2020, : 386 - 386