Author:
Schöning Uwe,Pruim Randall
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. J. Hartmanis, H.B. Hunt: The LBA problem and its importance in the theory of computing, in R. Karp, ed.: Complexity of Computation, Vol. VII, SIAM-AMS Proceedings, 1973, 27-42.
2. S.Y. Kuroda: Classes of languages and linear-bounded automata, Information and Control 7 (1964), 207–233.
3. J. Savitch: Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and Systems Sciences 4 (1970), 177–192.
4. N. Immerman: NSPACE is closed under complement, SIAM Journal on Computing 17 (1988), 935–938.
5. R. Szelepcsenyi: The method of forced enumeration for nondeterministic automata, Acta Informatica 26 (1988), 279–284.