NFA (Example) a 0 is the start state so (2)is the set of final states F b ∑={a,b} start S={0,1,2} Transition Function: Q b 0{0,1} {0} Transition graph of the NFA 1 {2} 2 The language recognized by this NFA is (alb)*a b CS308 Compiler Theory 11NFA (Example) a 0 is the start state s0 {2} is the set of final states F 0 2 1 a b start b {2} is the set of final states F Σ = {a,b} S = {0,1,2} Transition Function: a b b 0 {0,1} {0} 1 _ {2} 2 _ _ Transition graph of the NFA Th l i d b thi NFA i ( |b) * The language recognized by this NFA is (a|b) b * a CS308 Compiler Theory 11