Compiler tech:Program For Acceptance Of A String Using deterministic finite automaton (DFA) which is a finite state machine accepting finite strings of symbols. For each state, there is a transition arrow leading out to a next state for each symbol.