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 条

[31] GRAPH GRAMMARS AND AUTOMATA (SURVEY)
PETROV, SV
AUTOMATION AND REMOTE CONTROL, 1978, 39 (07) : 1034 - 1050
[32] Sequential grammars and automata with valences
Fernau, H
Stiebe, R
THEORETICAL COMPUTER SCIENCE, 2002, 276 (1-2) : 377 - 405
[33] Automata and Grammars for Data Words
Seki, Hiroyuki
IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2024, 2024, 15015 : 3 - 16
[34] On the Generative Power of ω-Grammars and ω-Automata
Chen, Zhe
FUNDAMENTA INFORMATICAE, 2011, 111 (02) : 119 - 145
[35] Unsafe grammars and panic automata
Knapik, T
Niwinski, D
Urzyczyn, P
Walukiewicz, I
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 1450 - 1461
[36] TREE AUTOMATA AND ATTRIBUTE GRAMMARS
KAMIMURA, T
LECTURE NOTES IN COMPUTER SCIENCE, 1983, 154 : 374 - 384
[37] TREE AUTOMATA AND ATTRIBUTE GRAMMARS
KAMIMURA, T
INFORMATION AND CONTROL, 1983, 57 (01): : 1 - 20
[38] Quantum automata and quantum grammars
Moore, C
Crutchfield, JP
THEORETICAL COMPUTER SCIENCE, 2000, 237 (1-2) : 275 - 306
[39] ON THE TRANSITION GRAPHS OF AUTOMATA AND GRAMMARS
CAUCAL, D
MONFORT, R
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 484 : 311 - 337
[40] Leftist grammars and the Chomsky hierarchy
Jurdzinski, T
Lorys, K
FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 293 - 304

← 1 2 3 4 5 →