Theory of Computation MCQ: 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

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

Correct Answer: 10

Make the most of this question

This page focuses on one Theory of Computation question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Theory of Computation MCQs All Engineering topics Mock test hub