A HIERARCHY OF RANDOM-CONTEXT GRAMMARS AND AUTOMATA

被引：6
|
作者：
EHLERS, EM
VONSOLMS, SH
机构：
来源：
INFORMATION SCIENCES | 1987年 / 42卷 / 01期
关键词：
D O I：
10.1016/0020-0255(87)90013-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：1 / 29
页数：29
相关论文
共 50 条
  • [21] Combination of context-free grammars and tree automata for unranked and ranked trees
    Fujiyoshi, Akio
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2008, 5148 : 283 - 285
  • [22] Complexity Results on Register Context-Free Grammars and Register Tree Automata
    Senda, Ryoma
    Takata, Yoshiaki
    Seki, Hiroyuki
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2018, 2018, 11187 : 415 - 434
  • [23] Nonterminal complexity of one-sided random context grammars
    Alexander Meduna
    Petr Zemek
    Acta Informatica, 2012, 49 : 55 - 68
  • [24] Nonterminal complexity of one-sided random context grammars
    Meduna, Alexander
    Zemek, Petr
    ACTA INFORMATICA, 2012, 49 (02) : 55 - 68
  • [25] Path languages of random permitting context tree grammars are regular
    Drewes, Frank
    van der Merwe, Brink
    FUNDAMENTA INFORMATICAE, 2008, 82 (1-2) : 47 - 60
  • [26] Cooperating Distributed Grammar Systems with Random Context Grammars as Components
    Krivka, Zbynek
    Masopust, Tomas
    ACTA CYBERNETICA, 2011, 20 (02): : 269 - 283
  • [27] USING RANDOM CONTEXT STRUCTURE GRAMMARS TO REPRESENT CHEMICAL STRUCTURES
    EHLERS, EM
    VONSOLMS, SH
    INFORMATION PROCESSING LETTERS, 1989, 30 (03) : 159 - 166
  • [28] Left Random Context ET0L Grammars
    Meduna, Alexander
    Zemek, Petr
    FUNDAMENTA INFORMATICAE, 2013, 123 (03) : 289 - 304
  • [29] WEB GRAMMARS AND WEB AUTOMATA
    EZAWA, Y
    ABE, N
    MIZUMOTO, M
    TOYODA, J
    TANAKA, K
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1973, 56 (04): : 35 - 42
  • [30] Control Systems on Automata and Grammars
    Chen, Zhe
    COMPUTER JOURNAL, 2015, 58 (01): : 75 - 94
12345