Multiple Choice
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
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q2: The language L = {anbnan n? 1}
Q3: A random access machine (RAM) and truing
Q4: The set that can be recognized by
Q5: Universal Turing machine (UTM) influenced the concepts
Q6: Which of the following conversion is not
Q8: Which is correct regard an off-line Truing
Q9: Given S = {a, b}, which one
Q10: He difference between a read-only Turing machine
Q11: In which of the stated below is
Q12: Choose the correct statement<br>A)recursive set ? recursive