The GATE Grind

GATE 2009 CS – Question 27

Digital Logic · Sequential Circuits · 2 marks · Multiple choice

An FSM has state bits A, B, one input and one output as shown below. Starting at A=0, B=0, what is the minimum input-string length that takes it to A=0, B=1 with output 1?

ABInputNext ANext BOutput
000001
010100
100010
110100
001010
011001
101011
111001
  1. 3
  2. 4
  3. 5
  4. 6

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (A) 3

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Sequential Circuits questions

All Sequential Circuits questions →