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

Given a Turing machine $$M,$$ a stings s and an integer $$k,$$ $$M$$ accepts $$s$$ within $$k$$ steps

Equivalence of two given Turing machines

Language accepted by a given finite state machine is not empty

Language generated by a context free grammar is non empty

Regular grammar to context free grammar

Non-deterministic $$FSA$$ to deterministic $$FSA$$

Non-deterministic $$PDA$$ to deterministic $$PDA$$

Non-deterministic Turing machine to deterministic Turing machine