0 votes 0 votes Is L2 regular? Theory of Computation theory-of-computation regular-language finite-automata + – Tuhin Dutta asked Dec 14, 2017 Tuhin Dutta 320 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments srivivek95 commented Dec 14, 2017 reply Follow Share @ srestha How L1 is regular? It would be regular if p+q<=10$^6$ Isn't it? 0 votes 0 votes Akash Mittal commented Dec 14, 2017 reply Follow Share @ srivivek95 L1 is reg. take small example {a^m b^n | m+n>=2} only strings which are not allowed is {epsilon, a, b} and all other strings {aa,bb, ab, aabb...} are allowed. 4 votes 4 votes srivivek95 commented Dec 14, 2017 reply Follow Share @ Akash mittal Thanks, got it now 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes L2 is not regular. Since, there are infinite possibilities of m for which m-n condition is satisfied.Also,there is one comparison. L1 is finite,so regular Angkit answered Mar 2, 2018 Angkit comment Share Follow See all 0 reply Please log in or register to add a comment.