Q. If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be (Solved)
1. recursive enumerable
2. recursive
3. context free language
4. none of these
- c. context free language
1. recursive enumerable
2. recursive
3. context free language
4. none of these