0 votes 0 votes 1)S1 is regular but not S2 2)S2 is regular but not S1 3)S1 and S2 are not regular 4)S1 and S2 are regular Theory of Computation theory-of-computation + – set2018 asked Dec 10, 2017 set2018 2.0k views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Rishabh Jain 1 commented Dec 10, 2017 reply Follow Share @set18 consider m and l as 1 always. Then language for L1 will be 00+11+ 0 votes 0 votes set2018 commented Dec 10, 2017 reply Follow Share but why always 1? 0 votes 0 votes srivivek95 commented Dec 10, 2017 reply Follow Share It's like you restrict m & l to1 and exercise all the other combinations for n & k which will ultimately generate all the languages that would have been generated if you had not restricted m & l to 1 (but still had m=l) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes only s2 is regular but in above discussion most of them are said that s1 and s2 are regular,but why they are keeping l=1 and m=1 always?????.can anyone explain?? BASANT KUMAR answered Jul 29, 2018 BASANT KUMAR comment Share Follow See all 0 reply Please log in or register to add a comment.