论文信息 - On resetting DLBA's

On resetting DLBA's

A long-standing open problem in complexity theory is whether NSPACE(n) is equa l to DSPACE(n) . NSPACE(n) (DSPACE(n)) is the class of languages accepted by linear-space nondeterministic (deterministic) multitape Turing machines . By Savitch's result [SAVI70], we know that NSPACE(n 1/2 ) is contained in DSPACE(n) . However, it is not known whether this result is optimal, i .e ., the following question i s open :

Oscar H. Ibarra

[1] 守屋悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[2] Tao Jiang,et al. On One-Way Cellular Arrays , 1987, SIAM J. Comput..

[3] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[4] Charles R. Dyer,et al. One-Way Bounded Cellular Automata , 1980, Inf. Control..

[5] Oscar H. Ibarra,et al. On the power one-way communication , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .