Acta Informatica

, Volume 26, Issue 3, pp 279–284

The method of forced enumeration for nondeterministic automata

  • Róbert Szelepcsényi

DOI: 10.1007/BF00299636

Cite this article as:
Szelepcsényi, R. Acta Informatica (1988) 26: 279. doi:10.1007/BF00299636


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].

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Róbert Szelepcsényi
    • 1
  1. 1.Department of Theoretical Cybernetics, Faculty of Mathematics and PhysicsKomensky UniversityBratislavaCzechoslovakia