0 votes 0 votes L(G)={$a^mb^n$|m>n>=1} is the language context free? Theory of Computation grammar + – aditi19 asked Aug 26, 2018 aditi19 577 views answer comment Share Follow See all 12 Comments See all 12 12 Comments reply Show 9 previous comments Deepanshu commented Aug 26, 2018 reply Follow Share @SHUBHAM SHASTRI can you please share the image of PDA ...?? MY MOBILE IS NOT IN GOOD CONDITION :( :( 0 votes 0 votes Mizuki commented Aug 26, 2018 reply Follow Share It is definitely CFL. Since you map every b for a and remove corresponding number of a's and eventually if you are left with any number of a > = 1 then you accept it. 0 votes 0 votes gauravkc commented Aug 26, 2018 reply Follow Share It is a CFL. And I think this is the grammar for it. $S\rightarrow aaABb$ $A\rightarrow aA|\epsilon$ $B\rightarrow aBb|\epsilon$ 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes Yes it should he CFL please correct me of I am wrong SHUBHAM SHASTRI answered Aug 26, 2018 SHUBHAM SHASTRI comment Share Follow See all 0 reply Please log in or register to add a comment.