1 votes 1 votes Which of the following is not context free? $I) L_{1}=\left \{ a^{i}b^{j}c^{k} |i,j,k\geq 0,i<j<k \right \}$ $I) L_{2}=\left \{ a^{i}b^{j}c^{k} |i,j,k\geq 0, j=max\left ( i,k \right )\right \}$ Theory of Computation context-free-language theory-of-computation + – srestha asked Nov 28, 2017 srestha 441 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments vamp_vaibhav commented Nov 29, 2017 reply Follow Share #Bhawna how will you check i>k if j counts in between.. I mean we can ignore counting of b but that would be again a problem to check whether j=i or not.. 0 votes 0 votes jatin saini commented Nov 29, 2017 reply Follow Share but there are two comparisons 1. i and k 2.j and k or j and i 0 votes 0 votes just_bhavana commented Nov 29, 2017 reply Follow Share @vaibhav yes you are correct. It will be difficult by that method to reject the strings not in the grammar as once we lose track of #$a's$ and if we encounter #$a's$ $\neq$ #$b's$ then we cannot backtrack to compare #$a's$ and #$c's$ 1 votes 1 votes Please log in or register to add a comment.