A finite state machine with the following state table has a single input x and a single output z. If initial state is unknown, then shortest input sequence to reach the inal state C is
|
Present state |
Next state, z |
|
|
|
X = 1 |
X =0 |
|
A |
D, 0 |
B, 0 |
|
B |
B, 1 |
C, 1 |
|
C |
B, 0 |
D, 1 |
|
D |
B, 1 |
C, 0 |
| A. | 01 |
| B. | 10 |
| C. | 110 |
| D. | 110 |
Answer : B Explanation : POONAM RANI said: (2:14am on Saturday 11th February 2017)
Incompletely automata bcz initial state is unknown
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
