0 votes 0 votes Theory of Computation theory-of-computation context-free-language identify-class-language + – Parshu gate asked Nov 6, 2017 Parshu gate 505 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments sourav. commented Nov 6, 2017 reply Follow Share For $L2$, it is as good as saying $a^nb^nc^n$ which is clearly a $CSL$. For $L_1$, it is obvious that it is $CFL$ not $DCFL$ 1 votes 1 votes Parshu gate commented Nov 29, 2017 reply Follow Share Why is L1 not DCFL? 0 votes 0 votes sourav. commented Nov 29, 2017 reply Follow Share because there is non determinism involved in the form of "or". 1 votes 1 votes Please log in or register to add a comment.