2 votes 2 votes A FA accepting language L(A) has n states and m transition.L(A) is given as L(A)={x| if x∊L(A) then u∊L(A) for ∃u,v∊∑* where x=uv } Find no of final state in above NFA? Theory of Computation theory-of-computation + – saurav04 asked Dec 4, 2015 saurav04 290 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.