Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

4
  • $\begingroup$ Specifically, there is a unique minimal DFA for any regular language. And if it's this small, showing that the are the same is not difficult. $\endgroup$ Commented yesterday
  • 2
    $\begingroup$ I am not using in any way that the automaton is deterministic or minimal. Just that it is already given and quite simple. $\endgroup$ Commented yesterday
  • $\begingroup$ This is the method I am referring as $R^{(k)}_{ij}$ method. $\endgroup$ Commented 7 hours ago
  • $\begingroup$ Yes, so it’s the same. $\endgroup$ Commented 5 hours ago