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

Let the sequence of states the machine goes through in response to the input sequence is . Then the output produced by the machine in response to this input is defined as .Note that a Moore machine produces an output without taking any input on state q0. That is, is the output in response to input . Hence, the length of the output string is always one more than that of the input string.                               

Example 1: Suppose we wish to determine exactly low many times the sub string occurs in the input string. The Moore machine presented by the given transition diagram
First   |   Last   |   Prev   |   Next