J. Hartmanis and H.B. Hunt, III, "The LBA Problem," Complexity of Computation, (ed. R. Karp), SIAM-AMS Proc. 7 (1974), 1-26.  Home/Search   Document Not in Database   Summary   Related Articles

....this paper we show that nondeterministic space s(n) is closed under complementation, for s(n) greater than or equal to log n. It immediately follows that the context sensitive languages are closed under complementation, thus settling a question raised by Kuroda in 1964 [9] See Hartmanis and Hunt [4] for a discussion of the history and importance of this problem, and Hopcroft and Ullman [5] for all relevant background material and definitions. The history behind the proof is as follows. In 1981 we showed that the set of first order inductive definitions over finite structures is closed under ....

J. Hartmanis and H.B. Hunt, III, "The LBA Problem," Complexity of Computation, (ed. R. Karp), SIAM-AMS Proc. 7 (1974), 1-26.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC