The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
94 views
Is WcW CFG?
asked in Theory of Computation by Junior (813 points) | 94 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.4k points)
selected by
I hope you are not getting confused with (W c Wreverse)
Updated! Thanks for pointing it out.


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,154 questions
36,975 answers
92,133 comments
34,816 users