Is the language { ww | w ∈ {a,b}* } context free? I have tried to create a pushdown automaton but I didn't find any solution. I think you need a queue and not a stack.
Is there a way to prove this statement using the pumping lemma?
Asked
Active
Viewed 3,869 times
