Question

In an NFA and a DFA, what is the difference between an accepting state and a reachable state?

Answer 1

A reachable and accepting state can be found in both DFA and NFA. The main difference between two states is the continuity of the machine after reaching that specific state.

A reachable state is a state that can be reached from current state by using the input string. From this state there can be another reachable or unreachable state.

An accepting state is the final state. It is a state in which machine halts and there is no input left in the string. Hence, at this state there is no further state to move on to.