in Theory of Computation
1,716 views
1 vote
1 vote
Is WcW CFG?
in Theory of Computation
1.7k views

1 Answer

0 votes
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.
selected by

2 Comments

I hope you are not getting confused with (W c Wreverse)
0
0
Updated! Thanks for pointing it out.
0
0

Related questions