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

Related Articles

GATE | GATE-CS-2014-(Set-3) | Question 46

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


Here, wr is the reverse of the string w. Which of these languages are deterministic Context-free languages?


None of the languages


Only L1


Only L1 and L2


All the three languages

Answer: (C)


For L1 and L2 we can design Deterministic Pushdown automata, so both are DCFL. 
But for L3, it is not possible to design deterministic PDA, because DPDA cannot determine where \’w\’ ends exactly so it could start popping symbols (for wr ) from the stack. 
Therefore, 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 : 08 Oct, 2021
Like Article
Save Article
Similar Reads