OPTIMAL SIMULATION OF 2-DIMENSIONAL ALTERNATING FINITE AUTOMATA BY 3-WAY NONDETERMINISTIC TURING-MACHINES

被引：0
|
作者：
ITO, A
INOUE, K
TAKANAMI, I
WANG, Y
机构：
来源：
THEORETICAL COMPUTER SCIENCE | 1995年 / 143卷 / 01期
关键词：
D O I：
10.1016/0304-3975(95)80014-X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that n log n space is sufficient for three-way nondeterministic Turing machines (3NTs) to simulate two-dimensional alternating finite automata (AFs), where n is the number of columns of rectangular input tapes. It is already known that n log n space is necessary for 3NTs to simulate AFs. Thus, our algorithm is optimal in the sense of space complexity point of view.
引用
下载
收藏
页码：123 / 135
页数：13
相关论文
共 28 条
123