GATE CSE
First time here? Checkout the FAQ!
x
0 votes
48 views
Is WcW CFG?
asked in Theory of Computation by Junior (621 points)   | 48 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.3k points)  
selected by
I hope you are not getting confused with (W c Wreverse)
Updated! Thanks for pointing it out.


Top Users Jul 2017
  1. Bikram

    3946 Points

  2. manu00x

    2464 Points

  3. Debashish Deka

    1842 Points

  4. joshi_nitish

    1650 Points

  5. Arjun

    1268 Points

  6. Hemant Parihar

    1184 Points

  7. Arnab Bhadra

    1100 Points

  8. Shubhanshu

    1052 Points

  9. Ahwan

    900 Points

  10. rahul sharma 5

    692 Points


24,016 questions
30,946 answers
70,303 comments
29,333 users