EE 110 Midterm: EE 110 NAU EExam 110 Probs308
Document Summary
Ee 110 practice problems for final exam, fall 2008: finite state machines: sequence recognizer. You want to build a nite state machine that will recognize the sequence x = 0110 and output the sequence z = 0001 as this sequence occurs. In other words, output z = 0 when rst receiving x = 0. Then output z = 0 if the next bit of x = 1; output z = 0 again if the following bit of x = 1. Finally, if the last (fourth) bit of x = 0, output z = 1. More simply, output z = 0 until the sequence x = 0110 is received, at which time output z = 1. First, draw and label the transitions in the state bubble diagram below. The states are already labeled (but state bit values have not been assigned). Include the input bits of x and output bits of z. Write the state table from the state bubble diagram.
