2-WAY NESTED STACK AUTOMATA ARE EQUIVALENT TO 2-WAY STACK AUTOMATA

被引：7

|

作者：

BEERI, C ^{[1
]}

机构：

[1] HEBREW UNIV JERUSALEM,INST MATH,JERUSALEM 91000,ISRAEL

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1975年 / 10卷 / 03期

关键词：

D O I：

10.1016/S0022-0000(75)80004-3

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：317 / 339

页数：23

相关论文

共 50 条

[21] 2-WAY AUTOMATA WITH MORE THAN ONE STORAGE MEDIUM
VOGEL, J
WAGNER, K
THEORETICAL COMPUTER SCIENCE, 1985, 39 (2-3) : 267 - 280
[22] PARALLEL AND 2-WAY AUTOMATA ON DIRECTED ORDERED ACYCLIC GRAPHS
KAMIMURA, T
SLUTZKI, G
INFORMATION AND CONTROL, 1981, 49 (01): : 10 - 51
[23] NOTES ON LOOPING DETERMINISTIC 2-WAY PUSHDOWN-AUTOMATA
LADERMANN, M
PETERSEN, H
INFORMATION PROCESSING LETTERS, 1994, 49 (03) : 123 - 127
[24] THE EXPRESSIVE POWER OF TRANSITIVE CLOSURE AND 2-WAY MULTIHEAD AUTOMATA
BARGURY, Y
MAKOWSKY, J
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 1 - 14
[25] 2-WAY DETERMINISTIC FINITE AUTOMATA ARE EXPONENTIALLY MORE SUCCINCT THAN SWEEPING AUTOMATA
MICALI, S
INFORMATION PROCESSING LETTERS, 1981, 12 (02) : 103 - 105
[26] 1-WAY STACK AUTOMATA
GINSBURG, S
GREIBACH, SA
HARRISON, MA
JOURNAL OF THE ACM, 1967, 14 (02) : 389 - &
[27] NOTE ON LINEAR TIME SIMULATION OF DETERMINISTIC 2-WAY PUSHDOWN AUTOMATA
JONES, ND
INFORMATION PROCESSING LETTERS, 1977, 6 (04) : 110 - 112
[28] NESTED STACK AUTOMATA
AHO, AV
JOURNAL OF THE ACM, 1969, 16 (03) : 383 - &
[29] A HARDEST LANGUAGE RECOGNIZED BY 2-WAY NONDETERMINISTIC PUSHDOWN-AUTOMATA
RYTTER, W
INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 145 - 146
[30] LANGUAGES SIMULTANEOUSLY COMPLETE FOR ONE-WAY AND 2-WAY LOG-TAPE AUTOMATA
HARTMANIS, J
MAHANEY, S
SIAM JOURNAL ON COMPUTING, 1981, 10 (02) : 383 - 390

← 1 2 3 4 5 →