0 votes 0 votes closed Is the following language CFL? L = complement of {$a^ib^jc^k$ | i!=j and j!=k} Theory of Computation theory-of-computation context-free-language + – Manu Thakur asked Sep 29, 2017 • closed Sep 29, 2017 by LeenSharma Manu Thakur 597 views comment Share Follow See all 6 Comments See all 6 6 Comments reply Shubhanshu commented Sep 29, 2017 reply Follow Share not a cfl. 0 votes 0 votes joshi_nitish commented Sep 29, 2017 reply Follow Share i think L = ($\sum$* - a*b*c*) $\cup$ ({aibjck| i=j or j=k}) which is CFL 1 votes 1 votes Manu Thakur commented Sep 29, 2017 reply Follow Share @nitish I too think the same, that it is CFL but in Gateforum it is given not CFL, hence i asked. 0 votes 0 votes joshi_nitish commented Sep 29, 2017 reply Follow Share @manu00x please, see my answer again 0 votes 0 votes Manu Thakur commented Sep 29, 2017 i edited Sep 29, 2017 reply Follow Share @nitish, i think your logic is absolutely correct, this language mentioned by you will exlcude only the language when a,b,and c are not equal. 0 votes 0 votes Warlock lord commented Sep 30, 2017 i edited by Warlock lord Sep 30, 2017 reply Follow Share If the question were L = complement of {aibjck | i!=j OR j!=k} This would not be a CFL but just a CSL right? 0 votes 0 votes Please log in or register to add a comment.