5 votes 5 votes L = {anbm | n mod m = 0 , n>=0 , m>0} Given language is A) CFL B) CSL C) DCFL D) REC E) RE Theory of Computation theory-of-computation + – Himanshu1 asked Oct 31, 2015 • edited Nov 4, 2015 by Himanshu1 Himanshu1 633 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Himanshu1 commented Nov 4, 2015 reply Follow Share So, it should be CSL ?? nd sir, i m not good in pumping lemmas..but ya, I think it requires division so shud be CSL. 0 votes 0 votes Arjun commented Nov 4, 2015 reply Follow Share yes. Whatever you can write a C code for, will be a CSL. Options D and E are also true. But CSL is the most appropriate. 2 votes 2 votes sourav. commented Jan 3, 2018 reply Follow Share @arjun sir :can't we write the above language as -: $L=\left \{ a^{n}b^{m} | n=k \times m\right \}$ there is no way to check this language using stack. 0 votes 0 votes Please log in or register to add a comment.
