what is dfa
In the theory of computation , a branch of theoretical computer science , a deterministic finite automaton ( DFA ) âalso known as a deterministic finite accepter ( DFA ) and a deterministic finite state machine ( DFSA ) âis a finite-state machine that accepts and rejects finite strings of symbols and only produces a unique computation ( or run ) of ...