1 votes 1 votes Give CFG for the following language L =$ {(a^{m})(b^{m+n})(c^{n}) | m,n= 0,1,2,.....}$ Theory of Computation theory-of-computation context-free-language + – The Capricorn asked Apr 12, 2018 • edited Apr 12, 2018 by srestha The Capricorn 371 views answer comment Share Follow See 1 comment See all 1 1 comment reply sonveer tomar 1 commented Apr 12, 2018 reply Follow Share understand the lang. first. you can break this lang. into two part first a^mb^m. which can be generated by grammar A=>aAb|e. now another part of lang. b^nc^n. grammar for this B=> aBb|e. now join both part of grammar together with help of new symbol which will be your start symbol. S=>AB A=>aAb|e B=>bBc|e. 1 votes 1 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes S$\rightarrow$XY X$\rightarrow$aXb|$\epsilon$ Y$\rightarrow$bYc | $\epsilon$ Tesla! answered Apr 12, 2018 • selected Apr 13, 2018 by The Capricorn Tesla! comment Share Follow See all 3 Comments See all 3 3 Comments reply Mk Utkarsh commented Apr 12, 2018 reply Follow Share $abbc$? 1 votes 1 votes Tesla! commented Apr 12, 2018 reply Follow Share Got my mistake check it now 0 votes 0 votes Mk Utkarsh commented Apr 12, 2018 reply Follow Share Correct (y) 0 votes 0 votes Please log in or register to add a comment.