GATE CSE
First time here? Checkout the FAQ!
x
0 votes
27 views
Is WcW CFG?
asked in Theory of Computation by Junior (597 points)   | 27 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 Mar 2017
  1. rude

    4768 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2728 Points

  5. Debashish Deka

    2602 Points

  6. 2018

    1572 Points

  7. Vignesh Sekar

    1422 Points

  8. Akriti sood

    1362 Points

  9. Bikram

    1334 Points

  10. Sanjay Sharma

    1126 Points

Monthly Topper: Rs. 500 gift card

21,516 questions
26,842 answers
61,139 comments
23,176 users