S1: INITIAL STATE. S7: FINAL STATE. INTRUDER STATE: IF NOT MATCHED WITH PASSWORD. STATE DIAGRAM: 0 S1 S2 0 0 1 S3 0 S4 S

[answerhappygod]

S1 Initial State S7 Final State Intruder State If Not Matched With Password State Diagram 0 S1 S2 0 0 1 S3 0 S4 S 1 (29.45 KiB) Viewed 57 times

S1 Initial State S7 Final State Intruder State If Not Matched With Password State Diagram 0 S1 S2 0 0 1 S3 0 S4 S 2 (31.57 KiB) Viewed 57 times

S1: INITIAL STATE. S7: FINAL STATE. INTRUDER STATE: IF NOT MATCHED WITH PASSWORD. STATE DIAGRAM: 0 S1 S2 0 0 1 S3 0 S4 S5 1 1 0 1 INTRUDER 0 0|1 S6 S7 1 from above diagram,

d) Minimize the size of the state set by computing the state equivalence relations. Hint: The minimized machine must have four states. (Name it Machine M2) e) Change one non-final state in the original eight-state machine (Machine M1) into a final state. (Name it Machine M3) h) What is the regular expression for the language accepted by Machine M3? g) Redo the minimization in (e). (Name it Machine M4) h) How large could the new state set be? How small could it be? (Machine M4)