Stephen A. Cook. A taxonomy of problems with fast parallel algorithms. Stephen A. Fenner, Lance J. Fortnow, and Stuart A. Kurtz. Gap-definable counting classes. Computational complexity of probabilistic Turing machines.
Nondeterministic space is closed under complementation.
Noam Nisan and Amnon Ta-Shma. Symmetric Logspace is closed under complement. Walter L. Ruzzo, Janos Simon, and Martin Tompa. Space-bounded hierarchies and probabilistic computations. The method of forced enumeration for nondeterministic automata.