Due: Friday, September 27, 2024, 11:00 am (start of the class)

Email Ying your homework. The email subject should follow this format CS232 Fall2024 HW3 -- Your Name.

Consider a Moore state machine that can recognize non-overlapping sequences of three 1s in a continuous stream of bits. The state machine has a one bit input and a one bit output, and it should output a 1 only when it detects the third 1 of the sequence.

1. How many states do you need for this state machine, and how many bits would you need to hold the state information?
2. Give a label for each state and describe the meaning of each state.
3. Draw the Moore Machine. Given a single input bit, each state should have two edges to the next state (one for 0, one for 1). For each state you defined above, indicate its output.
4. Given the string 11011110, show the sequence of states your state machine would follow if reading this string from left to right.

© 2024 Ying Li. Page last modified: .