Using induction prove that: if |wl = n then Iw'] =n. ily Consider the following grammar G=({S,A},{a,b), P,S} where P is

[answerhappygod]

Using Induction Prove That If Wl N Then Iw N Ily Consider The Following Grammar G S A A B P S Where P Is 1 (21.03 KiB) Viewed 47 times

Using induction prove that: if |wl = n then Iw'] =n. ily Consider the following grammar G=({S,A},{a,b), P,S} where P is given as: S-> aBb ba B->aBb bBa| a) Describe the language generated by the grammar G. b) Derive the following strings w1 and w2 using grammar G: w1 =bababa and W2 =abaab - Identify the type of the grammar?