I need help to build DFA over the alphabet {0,1} that get all the even words which does not include the sequence 101.
For exemple:
valid words: 10, 1000 ,1001, 1100, 1111,0000
Invaild words: 111101, 111,1011, 0, 1
Note: The machine should accept the sequnce 10 and 01.
Even word is mean the the length of the word and not the sum of the numbers.