In trying to gain a better understanding of finite state machines, I stumbled across this idea and have been confused as to how to approach this case in terms of a DFA.
The set of binary strings of length at least 3 where every substring of length 3 contains at least two 0s.
So in other words, something like 100100010 should be in the language (L) for this DFA but something like 11001010 would not be in the language.
I know that you can start off by writing/drawing smaller DFAs for the substrings that are the pattern 000, 010, 100, 001, etc, but I cannot seem to get a hold of how it should look all together.
Any help in understanding this would be appreciated.