Is there any standard way for converting CFL To Regular Expression assuming CFL represents a regular language?
and i need to prove the language L = {w#w | w belongs to {0,1}} to be not a CFL.
My approach was:-
i can take a string say 0^k 1^k # 0^k 1^k as its in the language and i used pumping lemma and proved it to be non CFL is approach correct?
