0 votes 0 votes Given Answer D) I think the answer should be A) Complement of L1 will be ( i = j or j = k) right so there can be a NPDA that will accept this right ? Theory of Computation theory-of-computation + – Harsh181996 asked Feb 5, 2017 Harsh181996 423 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Sachin Mittal 1 commented Feb 5, 2017 reply Follow Share just saying that complement of L1 is not what u showed see this $\text{complement of } \{{a^mb^n \mid m=n\}}= \\ \text{complement of } \{{a^nb^n\}}= \\ \overline{a^nb^n} = \{{a^mb^n \mid m\neq n\}} \cup \{{(a+b)^*ba(a+b)^*\}}$ here i have taken a small language, to show u complement. When it comes to answer the type of language question, then we ignore union part. bcoz its always regular. 0 votes 0 votes Harsh181996 commented Feb 5, 2017 reply Follow Share so compliment is basically everything except the given language , so the compliment that I wrote is just a small part of the total compliment right ? So will the compliment for the above question be - ( i = j or j = k) and all the strings that donot follow the order of the given language ( eg:bac, cba, etc...) 0 votes 0 votes Sachin Mittal 1 commented Feb 5, 2017 reply Follow Share ^ exactly :) but to answer questions in which they ask "Type of language" we can ignore "all the strings that donot follow the order of the given language ( eg:bac, cba, etc...)" this part, bcoz this is always regular :) 1 votes 1 votes Please log in or register to add a comment.