Question: Let M be the finite state machine given in the state diagram shown in Fig. 7.26. (a) Minimize machine M. (b) Find a (minimal) distinguishing
(a) Minimize machine M.
(b) Find a (minimal) distinguishing string for each given pair of states:
(i) s3, s6;
(ii) s3, s4; and
(iii) s1, s2.
.png)
1,0 1,0 0, 0 S1 S5 53 1,0,0 0, 0 S4 56 0, 1 0, 1 1. 0 Figure 7.26
Step by Step Solution
3.31 Rating (157 Votes )
There are 3 Steps involved in it
a s 1 and s 7 are equivalent ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
954-M-L-A-L-S (7895).docx
120 KBs Word File
