| Some decision properties of Regular Languages | ||
The following two theorems prove the equivalence of Moore and Mealy machines in this sense. Theorem : If Proof : We construct a Mealy machine
That is, the output associated with state q in the Moore machine will be associated with
the transitions going to the state q (from other state) on the same input symbol |
||