Hello I am learnign about finite automata and I want to see if these diagrams and my explanation make sense.
{w ∈ Σ∗ | w contains the substring 1010} using five states
- There is the substring of 1010 in the states. If you broke the substring you need to loop back
- Accept state with either 0 or 1 as the ending
w ∈ Σ∗ | w contains exactly two 0s, or at least two 1s} using six states.
- Start with pre state
- Two paths: The first path is for two 0s. There is no loops for the 0s. The second path is the 1s, there needs to be at least 2 and go up to infinite
- E is Sigma
