GATE 2009 CS – Question 27
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?
| A | B | Input | Next A | Next B | Output |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 0 | 1 |
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