0 votes 0 votes Anyone explain this language L={a^nb^m| m+n>=p is regular language or not kallu singh asked Dec 5, 2018 kallu singh 311 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments kumar.dilip commented Dec 5, 2018 reply Follow Share What do you mean by p is fixed then regular ?? Please explain shaik. 0 votes 0 votes Shaik Masthan commented Dec 5, 2018 reply Follow Share i mean, if L = {a$^n$.b$^m$ | m+n ≥ 5 } or L = {a$^n$.b$^m$ | m+n ≥ 500000 } like that then it is RL otherwise i have to remember how many a's and how many b's are processed in infinite manner... 0 votes 0 votes kumar.dilip commented Dec 5, 2018 reply Follow Share okk thanks. 0 votes 0 votes Please log in or register to add a comment.