← GATE CSE 1990

Q3-vi

MSQMarks unknown

Recursive languages are:

(A)

A proper superset of context free languages.

(B)

Always recognizable by pushdown automata.

(C)

Also called type $0$ languages.

(D)

Recognizable by Turing machines.

Sign in to save attempts.

Loading…