0 votes 0 votes Consider the grammar with productions $S\rightarrow aaB,$ $A\rightarrow bBb|\lambda,$ $B\rightarrow Aa.$ Show that the string $aabbabba$ is not in the language generated by this grammar. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 221 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes THE language generated is L = aa( (bab)^n )a hence the given string is never possible. JAINchiNMay answered Oct 11, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.