| Some decision properties of Regular Languages | ||||
Hence: , proving the equivalence as defined. Note that, to construct an equivalent Moore machine from a Mealy machine we cannot adopt the reverse process given in the above constructions i.e. simply push the output associated with a transition to the state (where this, transition leads to) to be considered as the output produced by the state. This is because, there may be two transitions going to a state with different outputs associated with it as shown below.
|
||||