0 votes 0 votes closed with the note: Query Resolved Is L = { $a^{n}b^{n}c^{2n}$ | n>=0 } a context free language? CJ147 asked Oct 24, 2018 closed Oct 24, 2018 by CJ147 CJ147 579 views comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments Mk Utkarsh commented Oct 24, 2018 reply Follow Share abbc is accepted 1 votes 1 votes tusharp commented Oct 24, 2018 reply Follow Share If you do like tha, how you are making sure equal number of a and b? Please check the answer once you will get the logic. 1 votes 1 votes Verma Ashish commented Oct 24, 2018 reply Follow Share And there will be no comparison between no. of a's and b's 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes Push a onto the stack. Then for every a pop b. This way we get equal number of a and b. Now to push c which are twice of a or b, we don't have count as stack is empty. So it is not CFL. It can be done by LBA and hence CSL. tusharp answered Oct 24, 2018 tusharp comment Share Follow See all 0 reply Please log in or register to add a comment.