4. If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be A. recursive enumerable B. recursive C. context free language (cfl) D. none of them

By ayush goel in 27 Sep 2023 | 11:54 am
ayush goel

ayush goel

 Student
Posts: 346
Member since: 21 Sep 2023

4. If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be
A. recursive enumerable
B. recursive
C. context free language (cfl)
D. none of them
27 Sep 2023 | 11:54 am
0 Likes

Report

Please describe about the report short and clearly.