1

Let L = { uv composed of {0,1} | |u| = |v| and u = v }

Do we agree that this language is not a Context Free Language ?

If not, why ? Can you give me a pushdown automata that recognizes it or the grammar that describes it ?

Thanks in advance for your help !

0 Answers0