Q2.5

MCQ2 marks, −0.5

The finite state machine described by the following state diagram with $A$ as starting state, where an arc label is $x/y,$ and $x$ stands for $1$ -bit input and $y$ stands for $2$ -bit output

(A)

outputs the sum of the present and the previous bits of the input

(B)

outputs $01$ whenever the input sequence contains $11$

(C)

outputs $00$ whenever the input sequence contains $10$

(D)

none of the above

Loading…