With let M be the finite state machine given in Table 6.15. Here s0 is the starting state. Let A f + where x A

With

let M be the finite state machine given in Table 6.15. Here s0 is the starting state. Let A Š‚ f + where x Š‚ A if and only if the last symbol in w(s0, x) is 1. [There may be more than one 1 in the output string w(s0, x).] Construct a finite state machine wherein the last symbol of the output string is 1 for all y ˆˆ f+ - A.

Table 6.15 0 0 0 So Si S1 0