What does DFA stand for in finite automata?

DFA refers to deterministic finite automata. Deterministic refers to the uniqueness of the computation. The finite automata are called deterministic finite automata if the machine is read an input string one symbol at a time.
For More Information Please Refer:

You May Also Like to Read: