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

    4670 Points

  2. Bikram

    4576 Points

  3. akash.dinkar12

    3428 Points

  4. rahul sharma 5

    3124 Points

  5. manu00x

    2882 Points

  6. makhdoom ghaya

    2460 Points

  7. just_bhavana

    2142 Points

  8. Tesla!

    2050 Points

  9. stblue

    2026 Points

  10. joshi_nitish

    1686 Points


24,979 questions
32,079 answers
74,606 comments
30,153 users