Mathematical Foundation of Computer Science

DHARM

246 MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE

Table III

State

Input symbol

0

[C , 0] 0

1

[C , 1] 0

[C , 0] 1

[C , 1] 1

[C , 0] 2

[C , 1] 2

[C , 0] 0

[C , 0] 0

[C , 1] 0

[C , 1] 0

[C , 0] 1

[C , 0] 1

[C , 1] 1
[C , 1] 1
[C , 0] 2
[C , 0] 2
[C , 1] 2
[C , 1] 2
Since C 0 is the start state of the Melay machine corresponds to that we obtain two states
of Moore, from them any one is selected as starting state which is marked by an arrow. Let we
select [C 0 , 0] is the starting state then we construct the state diagram of the Moore machine
shown in Fig. 9.42.

[,1]C 0

1

(^01) [,1]C 1 [,0]C 2
[,0]C 0 00 [,0]C 1 [,1]C 2
0
0
1 0 1
1
1
Fig. 9.42 Moore machine.
Example 9.15. Construct the equivalent Moore machine from Melay machine shown in Fig. 9.43.
A D
C
B
b/1
a/0 a/1
a/1
b/0 a/0
b/1
b/0
Fig. 9.43