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

Name: 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
Brand: Quizplus
Rating: 4.9 (31 reviews)

Question

Quizplus · Accepted Answer

The Answer is A

Consider the State Table of a Finite State Machine That