The finite state machine described by the following state diagram with A as…
2002
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 these
Attempted by 15 students.
Show answer & explanation
Correct answer: A
To determine the function, analyze the transitions from each state. State A represents a previous input of 0; inputs 0 and 1 yield outputs 00 and 01. States B and C represent a previous input of 1; inputs 0 and 1 yield outputs 01 and 10. This pattern corresponds to the sum of the current input bit and the previous input bit.
A video solution is available for this question — log in and enroll to watch it.