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 条

[41] BOTTOM-UP TREE PUSHDOWN-AUTOMATA AND REWRITE SYSTEMS
COQUIDE, JL
DAUCHET, M
GILLERON, R
VAGVOLGYI, S
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 488 : 287 - 298
[42] OMEGA-CONTINUOUS SEMIRINGS, ALGEBRAIC SYSTEMS AND PUSHDOWN-AUTOMATA
KUICH, W
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 443 : 103 - 110
[43] THE EQUIVALENCE PROBLEM FOR REAL-TIME DETERMINISTIC PUSHDOWN-AUTOMATA
ROMANOVSKII, VY
CYBERNETICS, 1986, 22 (02): : 162 - 175
[44] DETERMINISTIC 2-WAY ONE-HEAD PUSHDOWN-AUTOMATA ARE VERY POWERFUL
MONIEN, B
INFORMATION PROCESSING LETTERS, 1984, 18 (05) : 239 - 242
[45] TIME-COMPLEXITY OF LOOP-FREE 2-WAY PUSHDOWN-AUTOMATA
RYTTER, W
INFORMATION PROCESSING LETTERS, 1983, 16 (03) : 127 - 129
[46] Bounded-oscillation Pushdown Automata
Ganty, Pierre
Valput, Damir
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (226): : 178 - 197
[47] AN EXTENDED DIRECT BRANCHING ALGORITHM FOR CHECKING EQUIVALENCE OF DETERMINISTIC PUSHDOWN-AUTOMATA
TOMITA, E
THEORETICAL COMPUTER SCIENCE, 1984, 32 (1-2) : 87 - 120
[48] DETERMINISTIC TREE PUSHDOWN-AUTOMATA AND MONADIC TREE REWRITING-SYSTEMS
SALOMAA, K
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 37 (03) : 367 - 394
[49] THE EQUIVALENCE PROBLEM FOR REAL-TIME STRICT DETERMINISTIC PUSHDOWN-AUTOMATA
MEITUS, VY
CYBERNETICS, 1989, 25 (05): : 581 - 594
[50] A FAST ALGORITHM FOR CHECKING THE INCLUSION FOR VERY SIMPLE DETERMINISTIC PUSHDOWN-AUTOMATA
WAKATSUKI, M
TOMITA, E
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1993, E76D (10) : 1224 - 1233

← 1 2 3 4 5 →