in Theory of Computation
283 views
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?

in Theory of Computation
283 views

Please log in or register to answer this question.

Related questions