theory of computation

Question

Let $L=\{w \in \{0,1\}^∗\mid \text{number of occurences  of }(110)=\text{number of occurences  of } (011)\}$

What is $L$?

Comments

i think this is different question

---

MK Utkash almost same question

---

you are right sir :)

same DFA will satisfy this too

Answer 1

This language should be Regular...

acc. to question if we take string 011011011
In this string, number of  011 are 3 but 110 is 3.

But if we add a 0 at the last of string we will have same number of occurrences of 011 and 110 so this string is accepted.

By this we can construct DFA.