-3
$\begingroup$

That is, check if two NFA states accept the same language?

$\endgroup$

closed as unclear what you're asking by Yuval Filmus, Evil, David Richerby, Discrete lizard Feb 9 at 18:48

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

  • $\begingroup$ What do you mean by "NFA states"? Is this what you are looking for? $\endgroup$ – dkaeae Feb 8 at 16:43
  • $\begingroup$ @dkaeae Probably the intended definition is that two states of two (not necessarily distinct) automata "accept the same language" if modifying the automata to have the given states as their start states results in automata that accept the same language. $\endgroup$ – David Richerby Feb 8 at 17:05
  • 2
    $\begingroup$ Please try to explain your question more clearly. $\endgroup$ – Yuval Filmus Feb 8 at 17:09