0 votes 0 votes A. L2 is DCFL B. L2 is CFL but not DCFL C. L2 is not CFL D. None of these nepobose asked Jan 21, 2019 nepobose 372 views answer comment Share Follow See 1 comment See all 1 1 comment reply balchandar reddy san commented Jan 21, 2019 reply Follow Share L2 is not CFL as we need two comparisons..the language is same as a^mb^mc^m. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes The correct answer is B. if(m=n) then (n=k) can be written as (m!=n) or (n=k). And this can be simulated by cfl, but not by dcfl. reboot answered Dec 27, 2020 reboot comment Share Follow See 1 comment See all 1 1 comment reply wander commented Jan 2, 2021 i reshown by wander Jan 2, 2021 reply Follow Share So according to you the language is, {a^m b^n c^k | m != n } U {a^m b^n c^k | n = k } But that’s not the case, language is {a^m b^n c^k | m != n } U {a^m b^n c^k | m = n = k } 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes (C) is correct. 2 Comparisons so minimum 2 stacks required. It is CSL Ravi kumar singh answered Jan 21, 2019 Ravi kumar singh comment Share Follow See all 0 reply Please log in or register to add a comment.