GATE CSE
First time here? Checkout the FAQ!
x
0 votes
16 views
Is WcW CFG?
asked in Theory of Computation by (447 points)   | 16 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 Jan 2017
  1. Debashish Deka

    9614 Points

  2. sudsho

    5554 Points

  3. Habibkhan

    4878 Points

  4. Bikram

    4774 Points

  5. Vijay Thakur

    4498 Points

  6. Arjun

    4408 Points

  7. saurabh rai

    4236 Points

  8. Sushant Gokhale

    4112 Points

  9. Kapil

    3830 Points

  10. santhoshdevulapally

    3808 Points

Monthly Topper: Rs. 500 gift card

19,371 questions
24,203 answers
53,828 comments
20,370 users