1 votes 1 votes Theory of Computation theory-of-computation + – thor asked Jan 9, 2017 thor 391 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply santhoshdevulapally commented Jan 9, 2017 reply Follow Share i think both B and C are csl's. B: $0^{m}1^{m}1^{n}0^{m}$ // push all 0's and pop 1 for one 0.and skip 1's and $0^{m}$(remaining). // more than one comparison. C:$0^{m}0^{n}1^{n}1^{m}0^{m}$ // same as above $0^{m}$ is remaining .it is also CSL. 0 votes 0 votes thor commented Jan 9, 2017 reply Follow Share The way i approached is I put one of these as $1$. For example put $n = 1$. then option A comes to similar to $0^m10^m$ (CFL), whereas (2) and (3) as CSL. 0 votes 0 votes santhoshdevulapally commented Jan 9, 2017 reply Follow Share i think this also give wrong option in test series. 0 votes 0 votes Habibkhan commented Jan 10, 2017 reply Follow Share Yes it should be both 'b' and 'c' options as we cannot keep track of m in both cases.. 1 votes 1 votes Please log in or register to add a comment.