first we will convert that nfa to dfa by subset construction algorithm .start with a DFA M for A, and build a NFA M0 for A^(R)as follows: reverse all the arrows of M, and designate the start state for M as the only accept state q acc for M’. Add a new start state q 0 for M0 and from q 0 , add epsilon-transitions to each state of M0 corresponding to accept states of M. It is easy to verify that for any w ∈ Σ ^(*) , there is a path following w from the state start to an accept state in M iff there is a path following w^(R) from q 0 to q acc in M0 . It follows that w ∈ A iff w^(R) ∈ A^(R).