NIELIT 2021 Dec Scientist B - Section B: 52

Question

A language $\text{L}$ is recognizable by a turing machine $\text{M}$ if and only if $\text{L}$ is a _____________ language.

• A. Type $0$
• B. Type $1$
• C. Type $2$
• D. Type $3$

Comments

Answer: A

Answer 1

option A.

Type 0 grammar is recognize by Turing machine.

Ref :https://courses.engr.illinois.edu/cs373/fa2010/Lectures/notes19.pdf