1 votes 1 votes Isn't the second one is CFL? Theory of Computation theory-of-computation identify-class-language made-easy-test-series + – Sukhdip Singh asked Jan 28, 2018 edited Mar 4, 2019 by ajaysoni1924 Sukhdip Singh 374 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Raveena Yadav 1 commented Jan 28, 2018 reply Follow Share no.. we push 0 n times and pop out on every 1 and that iis m times now for 2 that is 2n we dont left with n from which we can compare 2 votes 2 votes Sukhdip Singh commented Jan 28, 2018 reply Follow Share ohh my mistake....got it thanks!! 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Simplelly we can put n in place of m Becz n=m . Then language become L=$0^{n}1^{n} 2^{2n}$ which is csl. abhishekmehta4u answered Jul 4, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.