You are implementing a sequence detector for the pattern "1011" using a Moore state machine. Overlapping sequences are allowed. What is the absolute minimum number of states required, and what is the output of the state corresponding to the successful detection of the sequence?
A Moore machine's output depends strictly on the current state, not the input. To detect an N-bit sequence, a Moore machine requires N+1 states (the initial state plus one state for each bit matched). For the 4-bit sequence "1011", it requires 5 states (e.g., S_0, S_1, S_10, S_101, S_1011). The final state (S_1011) is the only state where the output is asserted (1).