GATE CSE
First time here? Checkout the FAQ!
x
0 votes
19 views
Is WcW CFG?
asked in Theory of Computation by Junior (581 points)   | 19 views

1 Answer

0 votes
Best answer
No! Considering W ∈ {a,b}*, we can't draw a PDA for the language.
Initially we push input alphabets (W) to stack and once we encounter c, we can't check if W = W.
answered by Active (2.1k points)  
selected by
I hope you are not getting confused with (W c Wreverse)
Updated! Thanks for pointing it out.
Top Users Feb 2017
  1. Arjun

    5502 Points

  2. Bikram

    4266 Points

  3. Habibkhan

    3972 Points

  4. Aboveallplayer

    3046 Points

  5. Debashish Deka

    2646 Points

  6. sriv_shubham

    2328 Points

  7. Smriti012

    2270 Points

  8. Arnabi

    2134 Points

  9. sh!va

    1932 Points

  10. mcjoshi

    1752 Points

Monthly Topper: Rs. 500 gift card

20,935 questions
26,054 answers
59,785 comments
22,209 users