Since the DFA was created to be a mathematical model of machines, DFA’s have a wide variety of applications throughout the engineering world. They can be used to model embedded systems before their physical design and construction. They can be used to help model parts of programming languages at the early phases. They can also be used to plan out software before its implementation by software engineers.
The power of the DFA lies in its simple definition and its ability to model many situations. A finite state machine gives a powerful yet simple way to plan complicated programs and hardware thereby reducing costs in implementation and maintenance.
- 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