Deterministic Finite Automata or Nondeterministic Finite Automata

Question

Deterministic Finite Automata or Nondeterministic Finite Automata that accepts the set of strings in ∑ = {0,1} such that every substring of length 4 contains at least three 1s.

Answer 1

Summary of video answer:

1. Note the pattern of the accepted and non-accepted strings.
2. Address any ambiguities in the question with your professor.
3. Reflect that pattern in a state diagram.
4. Go to a non-acceptance state when too many 0s are encountered.
5. Make sure to allow all accepted patterns (i.e. extra 1s are fine).