Here, wr is the reverse of the string w. Which of these languages are deterministic Context-free languages?
(A) None of the languages
(B) Only L1
(C) Only L1 and L2
(D) All the three languages
Explanation: For L1 and L2 we can design Deterministic Push down 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 poping symbols (for wr ) from the stack.
Therefore, option (C) is Correct.
Quiz of this Question