Q. 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 (Solved)
1. recursive enumerable
2. recursive
3. context free language (cfl)
4. none of them
- a. recursive enumerable