Question

Consider the language L = { w w : w ∈ { 0 , 1 } ∗ } is not context-free. Note that this is the language of all strings that consist of some combination of 0s and 1s, followed immediately by that same combination of 0s and 1s. For example, 0101, 101101, and 110110 are all in the language because they consist of a string followed by itself. Can you build a PDA to recognize this language? (Hint: you can't.) Why? Talk about how you might start trying to build a PDA for this language, possibly modeling it on the PDA for the language consisting of strings of the form w w R that we have seen.

Answer 1

I HAVE GIVEN THE EXPLANTION IF YOU HAVE ANY DOUBT YOU CAN ASK.

LIKE IT IF YOU UNDERSTOOD