This question is concerned with the FSM method. You are provided with the following problem specifications: A sequential circuit contains one input, w, and one output, z. Its function is to analyze...

Extracted text: This question is concerned with the FSM method. You are provided with the following problem specifications: A sequential circuit contains one input, w, and one output, z. Its function is to analyze each sequence of 4 bits and produce z=1 when the four previous values of w are 1001 or 1111; otherwise, z=0. The sequences can overlap. An example of the sequences is: w = 010111100110011111 000000100100010011


Extracted text: Using the class equivalence division method, minimize the state table below, and show your partitions (|]1 to I14) and your final reduced state table (hint: the reduced table contains 3 states). II1= II2= II3= II4= Present Next state Output state x = 0 x = 1 Y2Y1Y0 Y½Y1Y0 | Y½Y1Y0 x = 0 x = 1 A В C Present Next state Output B A C state x = 0 x = 1 C A D 1 Y1Y0 Y¡Yo Y¡Yo x = 0 x = 1 D E 1 E B 1