GATE | GATE CS 1997 | Question 46
Which of the following languages over {a,b,c} is accepted by a deterministic pushdown automata?
a. {wcwR ∣ w∈ {a,b}* }
b. {wwR ∣ w∈ {a,b,c}* }
c. {anbncn ∣ n ≥ 0 }
d. {w ∣ w is a palindrome over {a,b,c} }
Note: wR 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
Recommended Posts:
- GATE | GATE CS 1997 | Question 72
- GATE | GATE CS 1997 | Question 43
- GATE | GATE CS 1997 | Question 44
- GATE | GATE CS 1997 | Question 45
- GATE | GATE CS 1997 | Question 46
- GATE | GATE CS 1997 | Question 41
- GATE | GATE CS 1997 | Question 47
- GATE | GATE CS 1997 | Question 42
- GATE | GATE CS 1997 | Question 38
- GATE | GATE CS 1997 | Question 39
- GATE | GATE CS 1997 | Question 40
- GATE | GATE CS 1997 | Question 53
- GATE | GATE CS 1997 | Question 54
- GATE | GATE CS 1997 | Question 55
- GATE | GATE CS 1997 | Question 56
