GATE | GATE CS 1997 | Question 46

Which of the following languages over {a,b,c} is accepted by a deterministic pushdown automata?
a. {wcw^R ∣ w∈ {a,b}* }
b. {ww^R ∣ w∈ {a,b,c}* }
c. {aⁿbⁿcⁿ ∣ n ≥ 0 }
d. {w ∣ w is a palindrome over {a,b,c} }

Note: w^R  is the string obtained by reversing ‘w‘
(A) a
(B) b
(C) c
(D) d


Answer: (A)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post