The finite-state machine described by Table 14.2 does not have a reset input. Explain how you can get the machine in a known state regardless of its initial starting state by providing a fixed input sequence. An input sequence that always takes an FSM to the same state is called a homing sequence.

Data in Table 14.2

State 00 01 11 10 Next state in = 0 00 00 01 11 in = 1 01 11 10 00 in = 0 0 0 0 0 Out in = 1 0 0 0 1