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


Top Users Apr 2017
  1. akash.dinkar12

    3518 Points

  2. Divya Bharti

    2558 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Shubham Sharma 2

    1610 Points

  7. Debashish Deka

    1608 Points

  8. Arunav Khare

    1464 Points

  9. Arjun

    1430 Points

  10. Kapil

    1424 Points

Monthly Topper: Rs. 500 gift card

22,076 questions
28,047 answers
63,238 comments
24,137 users