0 0 votes L1={$a^nb^m$:n>=0,m>n} L2={$a^nb^{2n}$:n>=0} find the grammar for L1L2 Theory of Computation + – Pranabesh Ghosh 1 545 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 1 1 vote S -> AB A ->aAC | C C -> bC | b B -> aBbb | $\varepsilon$ Sambit Kumar answered May 8, 2018 • selected May 8, 2018 by Pranabesh Ghosh 1 Sambit Kumar comment Share Follow See 1 comment 1 1 comment reply ram_18051996 commented Jan 16, 2019 reply Follow flag Thank you 0 0 replyShare Please log in or register to add a comment.