0 votes 0 votes A language $\text{L}$ is recognizable by a turing machine $\text{M}$ if and only if $\text{L}$ is a _____________ language. Type $0$ Type $1$ Type $2$ Type $3$ Others nielit2021dec-scientistb + – soujanyareddy13 asked Dec 7, 2021 • edited Dec 14, 2021 by soujanyareddy13 soujanyareddy13 562 views answer comment Share Follow See 1 comment See all 1 1 comment reply raja11sep commented Dec 7, 2021 reply Follow Share Answer: A 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes option A. Type 0 grammar is recognize by Turing machine. Ref :https://courses.engr.illinois.edu/cs373/fa2010/Lectures/notes19.pdf Kabir5454 answered Dec 7, 2021 Kabir5454 comment Share Follow See all 0 reply Please log in or register to add a comment.