The state transition diagram below represents a finite state

The state transition diagram below represents a finite state machine that produces an output of a \'1\': Only when exactly three 1\'s are received in sequence. Only when at least three 1\'s are received in sequence When at least two 1\'s are received in sequence When at least one 0 is received in sequence

Solution

In finite machine we need 1 for state transition. But here we have three inputs at three different states.

Here it first look at 0 for s0 state, then 1 for transition. Then at s2 it will be 0 then it will transition to s0 state again then 1 as input for s0 and it will transit to s1 state. At this time input will be 1 for state transition to s2.

So the answer is option C) when at least two 1 in sequence.