Let $ - f = {0, 1} for the two finite state machines M1 and M2, given in Tables 6.16 and 6.17, respectively. The starting state for M1 is 50, whereas S3 is the starting state for M2.

We connect these machines as shown in Fig. 6.19. Here each output symbol from M1 becomes an input symbol for M2. For example, if we input 0 to M1, then w1(s0, 0) = 1 and V1 (s0, 0) = so- As a result, we then input 1 (= w1(s0, 0)) to M2 to get w2(s3, 1) = 1 and V2(s3, 1) = s4.

We construct a machine M =

that represents this connection of M1 and M2 as follows:

(a) Find a state table for machine M.
(b) Determine the output string for the input string 1101. After this string is processed, in which state do we find (i) machine M1? (ii) machine M2?

Table 6.16 Table 6.17 Vi V2 S4S4 S3 0 M1 M2 Figure 6.19 (S. 6, v, co) S-Si X S2, where S, is the set of internal states for M,, fori -1, 2 v: S g S, where y((s, I), x) = (vi (s, x), (t, ! (s, x))), for s e St, t e S2. and x eF o((s, t), x) , (s, x, for s eS. e S, and x e.