The complement of a recursively language is recursive.

The complement of a recursively enumerable language is recursively enumerable.

The complement of a recursively language is either recursive or recursively enumerable.

The complement of a context-free language is context-free.

A context free language

A context sensitive language

A regular language

Parsable fully only by a Turing machine