Finite automata are more generalized state transition diagrams. Divided into deterministic finite automata (DFA) and nondeterministic finite automata (NFA)
The difference between DFA and NFA: the initial state is different
Finite Automata
Uncertain Finite Automata
Why convert NFA to DFA?
NFA is an automaton with an uncertain state, so this automaton is inconvenient for machines to implement; DFA is an automaton with a finite definite state, and its state transition conditions are very deterministic, so it is more convenient for machines to implement