![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Consider the state table of a finite state machine that has input x and a single output z. The shortest input sequence to reach the final state C if the initial state is unknown is |
A. | 10 |
B. | 01 |
C. | 101 |
D. | 110 |
Answer» A. 10 |
View all MCQs in
Theory of ComputationNo comments yet