Question

1. Show that the following languages are context-free. You can do this by writing a context free grammar or a PDA, or you can use the closure theorems for context-free languages. For example, you could show that L is the union of two simpler context-free languages.

(d) L = {0, 1}* - L1, where L1 is the language {1010010001…10n-110n1 : n n ≥ 1}.

Answer 1

There are two wayS we cant build the irst we ue could buud a PDA (e count group ok them secand need to then to match But then oho gainst the da we do x third We don't need to thougla Check tha all Lis eastex simply have we Cre one that is oDna that to tHad Cardo pda makivg we Lotth non-determintd gaes theauala the Staiug basiz aLot+)t Sucture is tollawed non-detosministiPally to caunt that the Suxe chaose AISD One check that Pap g0es Pacepts coutain not One thep ahy nanch Suceeds hechaique ee coutd e used Use the Same in Cauld tarl 8 Ale ask how a to be the ahsuweY to have Suchire s that aus be in L that It could Cotat the Comect coula have xeatons dont tollow theule

2qion mustcodain one than that each did mmore Lis the onion Pacedeessos too laugiage thus 1Cot YY L8- 이 u이x H easy to shoo that L iT contax S Complements is -egwar uthus La is also andest ree you can biid eithex lat)) Since Context ee BDA CEG OX Yery Simlan tu Simple lanauage nTmntm Hence 16dextee