Nov2017 cs Q24
0. The language L = {aib ci │ i >= 0} over the alphabet {a, b, c} is:
- Option : C
- Explanation : For a launguage to be recursive it can be decided by Turing machine which means it will enter into final state and reject the rest and for DCFL it must decidable that- for a particular language, next character is going to accepted or not. and for more information Refer:Recursive and Recursive Enumerable Languages So, option (C) is correct.
