Theorem 3.2.5: Among all DGSMs equivalent to a given DGSM there is a unique one (up to isomorphism) which has the fewest states and is distinguished — this is called the reduced machine.
Lemma 3.2.4: Let M = (SM, _, _, _M, _M, s0) and N = (SN, _, _, _N, _N, t0) be DGSMs with s__SM and t__SN. Then if s _ t, _M(s, x) _ _N(t, x) for all x___*.
| Previous slide | Next slide | Back to first slide | View graphic version |