ON THE POWER OF BOUNDED CONCURRENCY .2. THE PUSHDOWN-AUTOMATA LEVEL

被引：0

作者：

HIRST, T ^{[1
]}

HAREL, D ^{[1
]}

机构：

[1] WEIZMANN INST SCI, DEPT APPL MATH & COMP SCI, IL-76100 REHOVOT, ISRAEL

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 431卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：1 / 17

页数：17

共 50 条

[31] On the power of bounded concurrency I: Finite automata
Drusinsky, Doron, 1600, Publ by ACM, New York, NY, United States (41):
[32] A HARDEST LANGUAGE RECOGNIZED BY 2-WAY NONDETERMINISTIC PUSHDOWN-AUTOMATA
RYTTER, W
INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 145 - 146
[33] DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR SYNCHRONOUS DETERMINISTIC PUSHDOWN-AUTOMATA
NEPOMNJASHCHAJA, AS
LECTURE NOTES IN COMPUTER SCIENCE, 1984, 176 : 425 - 432
[34] A NOTE ON ONE-WAY AUXILIARY PUSHDOWN-AUTOMATA
WANG, Y
XU, JL
INOUE, K
ITO, A
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (06) : 778 - 782
[35] CHARACTERIZING THE POLYNOMIAL HIERARCHY BY ALTERNATING AUXILIARY PUSHDOWN-AUTOMATA
JENNER, B
KIRSIG, B
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1989, 23 (01): : 87 - 99
[36] THE THEORY OF ENDS, PUSHDOWN-AUTOMATA, AND 2ND-ORDER LOGIC
MULLER, DE
SCHUPP, PE
THEORETICAL COMPUTER SCIENCE, 1985, 37 (01) : 51 - 75
[37] CHARACTERIZING THE POLYNOMIAL HIERARCHY BY ALTERNATING AUXILIARY PUSHDOWN-AUTOMATA
JENNER, B
KIRSIG, B
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 294 : 118 - 125
[38] ON THE POWER OF BOUNDED CONCURRENCY .1. FINITE AUTOMATA
DRUSINSKY, D
HAREL, D
JOURNAL OF THE ACM, 1994, 41 (03) : 517 - 539
[39] Pushdown automata with bounded nondeterminism and bounded ambiguity
Herzog, C
THEORETICAL COMPUTER SCIENCE, 1997, 181 (01) : 141 - 157
[40] A REAL-TIME STRICTNESS TEST FOR DETERMINISTIC PUSHDOWN-AUTOMATA
OYAMAGUCHI, M
INAGAKI, Y
HONDA, N
INFORMATION AND CONTROL, 1980, 47 (01): : 1 - 9

← 1 2 3 4 5 →