1. i) Using induction prove that: if wl = n then w'] =n. ii) Consider the following grammar G=({S,A},{a,b), P,S} where P

[answerhappygod]

1 I Using Induction Prove That If Wl N Then W N Ii Consider The Following Grammar G S A A B P S Where P 1 (25.52 KiB) Viewed 14 times

1. i) Using induction prove that: if wl = n then w'] =n. ii) Consider the following grammar G=({S,A},{a,b), P,S} where P is given as: S-> aBb | Ba B -> aBb Ba| 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 c) Identify the type of the grammar?