Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference6 articles.
1. Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Reading: Addison-Wesley 1969
2. Immerman, N.: Nondeterministic space is closed under complementation. Proceedings of the 3rd Annual Conference Structure in Complexity Theory, 14?17 June 1988, Washington D.C. (also TH Report YALEU/DCS/TR 552, July 1987)
3. Immerman, N.: Descriptive and computational complexity, (unpublished manuscript, 1987)
4. Kuroda, S.Y.: Classes of languages and linear-bounded automata. Inf. Control 7, 207?233 (1964)
5. Szelepcsényi, R.: Context-sensitive languages are closed under complementation, TR Komensky University, April 1987 (in Slovak)
Cited by
277 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献