in Theory of Computation
1,738 views
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

in Theory of Computation
by
1.7k views

4 Comments

@set18 consider m and l as 1 always. Then language for L1 will be 00+11+
0
0
but why always 1?
0
0
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
0

1 Answer

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??