72 views
L1= Set of all strings having equal number of 00 and 11.
L2= Set of all strings having equal number of 01 and 10.
Which of the following is true?
(a) Both are Regular (b) Both are Context-Free
(c) L1 is regular, L2 is Context Free (d) L1 is CF, L2 is Regular
0
0

Visit this link..you will know why L2 is regular :)

https://gateoverflow.in/47443/isi2014-cs-4a

## L2 is regular.

edited
0
make start state as final too.
0
Yes it also accept null .
0
Finite automata can not able to do unbounded comparisons , I am confused now, not able to think about this question ,please simplify it!
0
• At first we take a string which is accepted by dfa . And then compare string 01 and 10 we get equal .

0
how L1 is CFL?
0
We can not construct a DFA  for L1.
+1
what is the correct way to analyse such type of questions , The language is regular or CFL?
0
There are Some example which is really tough to find cfl or regular .First time i am  also get canfusd in this question . Only few question are in this type so we note down and remmember it.
0
thanks!

1
2