Some decision properties of Regular Languages
Print this page
First   |   Last   |   Prev   |   Next

Where b0 is any symbol in . Transition ' is defined as

      

That is, the first component of 's state determines the moves of and the second component of is the output associated with some transition in  into the state q.

Output functions ' of is defined as

Following the construction, it can easily been shown that if produces the output string in response to the input string after going through the states , then also produces the same output string in response to the same input string after going through the states

Example 3 : The equivalent Mealy machine for the Moore machine given in example 1 is produced below.

First   |   Last   |   Prev   |   Next