1 votes 1 votes what is the CFG for the language L=w where number of a’s in w+number of b’s in w=number of c’s in w how to approach this? Theory of Computation context-free-language theory-of-computation context-free-grammar + – aditi19 asked Mar 7, 2019 aditi19 860 views answer comment Share Follow See all 15 Comments See all 15 15 Comments reply Show 12 previous comments srestha commented Mar 8, 2019 reply Follow Share that means every cfl has cfg, but every cfg may not have cfl 0 votes 0 votes srestha commented Mar 8, 2019 reply Follow Share @Shaik Masthan chk this question https://gateoverflow.in/204109/gate2018-35 here chk this line "this grammar is CFG, so it can generate CFL" So, can we not say, every CFG can generate CFL? 0 votes 0 votes Shaik Masthan commented Mar 9, 2019 reply Follow Share that means every cfl has cfg, but every cfg may not have cfl WHO SAYS ? 0 votes 0 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes i am getting this . abhishekmehta4u answered Mar 8, 2019 • selected Mar 8, 2019 by aditi19 abhishekmehta4u comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Mar 8, 2019 reply Follow Share i think this is correct. 0 votes 0 votes Please log in or register to add a comment.
