Deterministic Finite Automaton (DFA) A Deterministic Finite Automaton (DFA)is a special form of a NFA. no state has s-transition for each symbol a and state s,there is at most one labeled edge a leaving s. i.e.transition function is from pair of state-symbol to state(not set of states) a The language recognized by this DFA is also (ab)*a b b CS308 Compiler Theory 12Deterministic Finite Automaton (DFA) • A Deterministic Finite Automaton (DFA) is a special form of a NFA A Deterministic Finite Automaton (DFA) is a special form of a NFA. • no state has ε- transition • for each symbol a and state s, there is at most one labeled edge a leaving s. i t iti f ti i f i f t t i.e. transition function is from pair o f s t a te-symb lt t t ( t t f t t ) b o l to s t a te (no t se t o f s t a tes ) a b a The language recognized by b a 0 2 1 a b b this DFA is also (a|b) * a b CS308 Compiler Theory 12