6. (20 points) Design a Finite State Machine that reads an arbitrary long input string and checks if it contains 2 or mo

[answerhappygod]

6 20 Points Design A Finite State Machine That Reads An Arbitrary Long Input String And Checks If It Contains 2 Or Mo 1 (47.89 KiB) Viewed 53 times

6. (20 points) Design a Finite State Machine that reads an arbitrary long input string and checks if it contains 2 or more consecutive 1s. Once two consecutive 1's are found, the output will stay at 1. For example, if input is 10110 from left to right, then the output will be 00011. a. Draw the Finite State Machine b. Encode states and show truth table c. Derive Boolean expressions d. Implement the circuit using D-flip-flops.