Deterministic Finite Automata (DFA)

Home > Languages > Formal Language > Finite Automata > Deterministic Finite Automata (DFA)

It is a type of finite automata in which for each input symbol, there is one unique transition leading to a new state.