In the context of a DFA (Deterministic Finite Automaton), the relation $\equiv_M$ is a state equivalence relation where two states $p$ and $q$ are equivalent (denoted $p \equiv_M q$) if and only if for all strings $x$, the state $p$ leads to an accepting state
Show more…