(1) show that {a^m b^n E {a,b}* :m,n E Z 1<=m<=n<=2m } is a context free languag
ID: 3537724 • Letter: #
Question
(1) show that {a^m b^n E {a,b}* :m,n E Z 1<=m<=n<=2m } is a context free language
(2) if {wcw^r{a,b}*} where w^r is the reverse of w and |c| <=3.show that A is a context free language providing a left free grammar G or a stack automato P such that L(G)=L(P)=A.determine a left free context language for A in chomsky normal form.
(3) consider the grammar G=(v,t,p,s) such that N={S,A},T={a,b},P={S--->AA,A--->AAA|a|bA|Ab}.For any positive integers m, n, p, depicts a derivation for the G chain b^m ab^n ab^p
Explanation / Answer
(1) show that {a^m b^n E {a,b}* :m,n E Z 1<=m<=n<=2m } is a context free language
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.