@article{Szelepcsenyi:AI:1988,
    Abstract = {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].},
    Author = {Szelepcs{\'e}nyi, R{\'o}bert},
    File = {The Method of Forced Enumeration for Nondeterministic Automata - 10.1007@BF00299636 (0) - a - a - s.pdf},
    ISSN = {1432-0525},
    Journal = {Acta Informatica},
    Month = {Nov},
    Number = {3},
    Pages = {279--284},
    Title = {The method of forced enumeration for nondeterministic automata},
    URL = {https://doi.org/10.1007/BF00299636},
    Volume = {26},
    Year = {1988},
    bdsk-url-1 = {https://doi.org/10.1007/BF00299636},
    date-added = {2019-10-12 12:25:43 +0200},
    date-modified = {2019-10-12 12:26:41 +0200},
    day = {01},
    doi = {10.1007/BF00299636}
}

@article{Szelepcsenyi:AI:1988, Abstract = {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].}, Author = {Szelepcs{\'e}nyi, R{\'o}bert}, File = {The Method of Forced Enumeration for Nondeterministic Automata - 10.1007@BF00299636 (0) - a - a - s.pdf}, ISSN = {1432-0525}, Journal = {Acta Informatica}, Month = {Nov}, Number = {3}, Pages = {279--284}, Title = {The method of forced enumeration for nondeterministic automata}, URL = {https://doi.org/10.1007/BF00299636}, Volume = {26}, Year = {1988}, bdsk-url-1 = {https://doi.org/10.1007/BF00299636}, date-added = {2019-10-12 12:25:43 +0200}, date-modified = {2019-10-12 12:26:41 +0200}, day = {01}, doi = {10.1007/BF00299636} }