Summary
Every family of languages, recognized by nondeterministic L(n) tape-bounded Turing machines, where L(n)≥logn, is closed under complement. As a special case, the family of context-sensitive languages is closed under complement. This solves the open problem from [4].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Reading: Addison-Wesley 1969
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)
Immerman, N.: Descriptive and computational complexity, (unpublished manuscript, 1987)
Kuroda, S.Y.: Classes of languages and linear-bounded automata. Inf. Control 7, 207–233 (1964)
Szelepcsényi, R.: Context-sensitive languages are closed under complementation, TR Komensky University, April 1987 (in Slovak)
Szelepcsényi, R.: The method of Forcing for nondeterministic automata. Bull. Eur. Assoc. Theor. Comp. Sci. 33, 96–100 (1987)
Author information
Authors and Affiliations
Additional information
This research was supported by the grant SP2V I-1-5/08
Rights and permissions
About this article
Cite this article
Szelepcsényi, R. The method of forced enumeration for nondeterministic automata. Acta Informatica 26, 279–284 (1988). https://doi.org/10.1007/BF00299636
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00299636