3 3 4 5 A Show That Given A Context Free Grammar G V 1 S P There Exists An Algorithm For Deciding Whether Or N 1 (35.5 KiB) Viewed 21 times
answer questions 5(a) and 6(b) please. for written exam. 5(a) for 3 marks and 6(b) for 5marks. its a theorem need to Probe
3 3+ 4 5. (a) Show that “Given a context-free grammar G = (V,1,S,P), there exists an algorithm for deciding whether or not L(G) is empty". (b) State and prove pumping lemma for infinite regular languages. Prove that L = {a"blak : k> n+1} is not regular. 6. (a) Construct an NPDA that accept the language L = {w: na (w) = 2n_ (w) } (b) Show that "If L is a regular language on the alphabet , then there exists a right-linear grammar G = (V,E,S,P) such that L=L(G). 5 5
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!