Question

(Automata): prove using the pumping lemma that the following language is not context-free:

where:
;

b)using closure properties and the previous proof, show that the following language is not context free language:


Really need your help with this, it is important for the test. please explain what you to do so i can study it throughly. thank you very much!

Labc be...bc2m de fefefnghqhq.h 1, т > п> о >0; > т,п, о 0; /12, ...j2n0; k1, k2,.. k, > 0 1, 22,.. 2m L= 0'12 i

Answer 1

ANS evey gula language is context eee fuee asd ft Context is a is Jeagalar too K L = abc 0) Pa9 Chere-mn, o 21 o<0<u<w dividing the Stademontim dbc bc Jan is egular mye Statemont b eagaloe longnge Ftatemort is also e eg war statemont So it but ad amd g mako it is not a coatexteee Statemont. 1L ikjzk L 2 = 1< 2 So omd K OXI2 seegulax Statemant Jee Statemerd t is not a it s ot a context