Deterministic Finite Automaton (DFA)
Deterministic Finite Automaton (DFA)
A finite automaton is deterministic if
- It has no edges/transitions labeled with epsilon.
- For each state and for each symbol in the alphabet, there is exactly one edge labeled with that symbol.
Such a transition graph is called a state graph.