0 votes 0 votes The language L = {anbk : | n – k | = 2} is regular or not? Anshu Singh Suryavan asked Sep 3, 2018 Anshu Singh Suryavan 227 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Abbas commented Sep 3, 2018 reply Follow Share I think it's not regular because grammar for the above language is S-> aSbbb / aaaSb / aaab / abbb And above mentioned grammar is neither left linear nor right linear so it can't be regular.. Correct me if I am wrong... 1 votes 1 votes Shaik Masthan commented Sep 3, 2018 reply Follow Share n-k=2 ===> n = k+2 ===> comparing n and k ===> CFL, moreover it is DCFL 1 votes 1 votes Verma Ashish commented Sep 3, 2018 reply Follow Share You can think in one more way... It is equivalent to — (${a^n}$${b^{n+2}}$ )+(${a^{n+2}}$${b^n}$). [informal notaion] We can't give any finite automata so it is not regular. 0 votes 0 votes Please log in or register to add a comment.