Skip to content
Related Articles
Get the best out of our app
GeeksforGeeks App
Open App

Related Articles

UGC-NET | UGC-NET CS 2017 Nov – III | Question 24

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

The language L = {aib ci │ i >= 0} over the alphabet {a, b, c} is:


a regular language.


not a deterministic context free language but a context free language.


recursive and is a deterministic context free language.


not recursive.

Answer: (C)


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

My Personal Notes arrow_drop_up
Last Updated : 19 Mar, 2018
Like Article
Save Article
Similar Reads