3 votes 3 votes $L = \left \{ a^{n} b^{m} : n\geq 0,m>n \right \}$ Find a grammar that generates $L^3$ Theory of Computation theory-of-computation peter-linz peter-linz-edition4 grammar + – Mk Utkarsh asked Feb 26, 2018 • edited Mar 19, 2019 by Naveen Kumar 3 Mk Utkarsh 488 views answer comment Share Follow See 1 comment See all 1 1 comment reply Ashwani Kumar 2 commented Feb 26, 2018 reply Follow Share $S \rightarrow AbAbAb $ $A \rightarrow aAb| Ab | \epsilon $ 1 votes 1 votes Please log in or register to add a comment.
Best answer 6 votes 6 votes $L^3 = \{a^pb^qa^rb^sa^tb^u|p,r,t\geq 0, q >p, s>r, u>t \}$ Grammar for this language: $S \rightarrow AAA$ $A \rightarrow aAb\ |\ B$ $B \rightarrow bB\ |\ b$ P.S. If you take $A$ as the starting symbol, then you get the language $L$. Rishabh Gupta 2 answered Feb 26, 2018 • selected Feb 26, 2018 by Mk Utkarsh Rishabh Gupta 2 comment Share Follow See all 0 reply Please log in or register to add a comment.