Recursive languages are:

GATE · 1990 · CS · Question 3 subparts

Recursive languages are:

  1. A.

    A proper superset of context free languages.

  2. B.

    Always recognizable by pushdown automata.

  3. C.

    Also called type $0$ languages.

  4. D.

    Recognizable by Turing machines.

Attempted by 7 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…