The language L = {aib ci │ i >= 0} over the alphabet {a, b, c} is:
(A)
a regular language.
(B)
not a deterministic context free language but a context free language.
(C)
recursive and is a deterministic context free language.
(D)
not recursive.
Answer: (C)
Explanation:
For a language 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.
Quiz of this Question
Please comment below if you find anything wrong in the above post
Article Tags :
Recommended Articles