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?
64.3k questions
77.9k answers
244k comments
80.0k users