Here are a few examples of DFAs. The Finite state machine that accepts all strings of s and s that have at least two s. The input is since the string only consists of s and s. The set of states is because it will only require three states to count two s. The transition function is defined as:
The automata will take in a string of s and s such as one character at a time. First , then , then , and finally which is a final state, therefore this DFA accepts the string 0101.
However if the automata is fed the string there will be an entirely different result. First , then , then , and finally . However is not a final state, therefore this DFA rejects the string .
- What is a Finite State Machine?
- Deterministic Finite Automata
- Examples of DFA part 1
- Examples of DFA part 2
- Examples of DFA part 3
- Combining DFAs
- Limits and Languages of DFAs
- Automata Theory, Languages, and Computation by John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman