1
Question
Consider the following FSM table :
Present
state A
Present
state B
Input
Next
state A
Next
state B
Output
0
0
1
1
0
1
0
1
1
1
1
1
1
1
0
1
0
1
0
1
1
1
0
0
0
0
1
1
0
1
0
1
0
0
0
0
0
1
1
0
1
0
1
1
1
0
0
0
If the inital state A = 0, B = 0 what is the minimum length of the input string which will take the machine to A = 1, B = 1 and output 0 is ____.
- 3
| Present state A |
Present state B |
Input | Next state A |
Next state B |
Output |
| 0 0 1 1 |
0 1 0 1 |
1 1 1 1 |
1 1 0 1 |
0 1 0 1 |
1 1 0 0 |
| 0 0 1 1 |
0 1 0 1 |
0 0 0 0 |
0 1 1 0 |
1 0 1 1 |
1 0 0 0 |
If the inital state A = 0, B = 0 what is the minimum length of the input string which will take the machine to A = 1, B = 1 and output 0 is ____.
- 3
Open in App
Solution
The correct option is A 3
So minimum length to get '0' output is 3.
Present
state
I/P
N
S
Output
0
0
1
0
1
1
0
1
1
0
1
1
1
1
1
1
1–
0
So minimum length to get '0' output is 3.
| Present | state | I/P | N | S | Output |
| 0 0 1 |
0 1 1 |
0 1 1 |
0 1 1 |
1 1 1 |
1 1– 0 |
Suggest Corrections
0
Similar questions
Join BYJU'S Learning Program
Join BYJU'S Learning Program
