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 条

[1] RANDOM CONTEXT STRUCTURE GRAMMARS AND AUTOMATA - A FORMAL APPROACH
VONSOLMS, SH
INFORMATION SCIENCES, 1991, 53 (1-2) : 159 - 183
[2] A hierarchy result for random forbidding context picture grammars
Ewert, S
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 1999, 13 (07) : 997 - 1007
[3] Random context structure grammars and automata. A formal approach
Ehlers, E.M., 1600, (53): : 1 - 2
[4] A property of random context picture grammars
van der Walt, A
Ewert, S
THEORETICAL COMPUTER SCIENCE, 2003, 301 (1-3) : 313 - 320
[5] On Erasing Productions in Random Context Grammars
Zetzsche, Georg
AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, 2010, 6199 : 175 - 186
[6] A VARIANT OF RANDOM CONTEXT GRAMMARS - SEMI-CONDITIONAL GRAMMARS
PAUN, G
THEORETICAL COMPUTER SCIENCE, 1985, 41 (01) : 1 - 17
[7] Simulating finite automata with context-free grammars
Domaratzki, M
Pighizzini, G
Shallit, J
INFORMATION PROCESSING LETTERS, 2002, 84 (06) : 339 - 344
[8] An Ambiguity Hierarchy of Weighted Context-Free Grammars
Inoue, Yusuke
Hashimoto, Kenji
Seki, Hiroyuki
IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2022), 2022, 13266 : 238 - 250
[9] An ambiguity hierarchy of weighted context-free grammars
Inoue, Yusuke
Hashimoto, Kenji
Seki, Hiroyuki
THEORETICAL COMPUTER SCIENCE, 2023, 974
[10] Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata
Lavado, Giovanna J.
Pighizzini, Giovanni
Seki, Shinnosuke
DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 284 - 295

← 1 2 3 4 5 →