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 条

[21] A SIMPLICITY TEST FOR DETERMINISTIC PUSHDOWN-AUTOMATA
OYAMAGUCHI, M
INAGAKI, Y
HONDA, N
INFORMATION AND CONTROL, 1980, 47 (01): : 10 - 36
[22] A GRAMMATICAL CHARACTERIZATION OF ALTERNATING PUSHDOWN-AUTOMATA
MORIYA, E
THEORETICAL COMPUTER SCIENCE, 1989, 67 (01) : 75 - 85
[23] TIME-VARYING PUSHDOWN-AUTOMATA
KRITHIVASAN, K
SRINIVASAN, V
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 24 (3-4) : 223 - 236
[24] REMARKS ON MULTIHEAD PUSHDOWN-AUTOMATA AND MULTIHEAD STACK AUTOMATA
MIYANO, S
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1983, 27 (01) : 116 - 124
[25] THE EXPRESSIBILITY OF NONDETERMINISTIC AUXILIARY STACK AUTOMATA AND ITS RELATION TO TREESIZE BOUNDED ALTERNATING AUXILIARY PUSHDOWN-AUTOMATA
VINAY, V
CHANDRU, V
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 472 : 104 - 114
[26] NOTES ON LOOPING DETERMINISTIC 2-WAY PUSHDOWN-AUTOMATA
LADERMANN, M
PETERSEN, H
INFORMATION PROCESSING LETTERS, 1994, 49 (03) : 123 - 127
[27] CHARACTERIZING UNAMBIGUOUS AUGMENTED PUSHDOWN-AUTOMATA BY CIRCUITS
LANGE, KJ
ROSSMANITH, P
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 452 : 399 - 406
[28] UNAMBIGUOUS SIMULATIONS OF AUXILIARY PUSHDOWN-AUTOMATA AND CIRCUITS
NIEDERMEIER, R
ROSSMANITH, P
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 583 : 387 - 400
[29] DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR DETERMINISTIC PUSHDOWN-AUTOMATA
MEITUS, VY
CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (05) : 672 - 690
[30] SYNCHRONIZABLE DETERMINISTIC PUSHDOWN-AUTOMATA AND THE DECIDABILITY OF THEIR EQUIVALENCE
CULIK, K
KARHUMAKI, J
ACTA INFORMATICA, 1986, 23 (05) : 597 - 605

← 1 2 3 4 5 →