State table of an FSM is given below. There are two states A And B, one input and one output. Let the initial state be A = 0 and B = 0. To take the machine to the state A = 0 and B = 1 with output = 1 the minimum length of input string required will be
A)2
B)7
C)4
D)3

Question

Quizplus · Accepted Answer

To achieve the desired state and output, the FSM must transition through a sequence of states that ultimately results in A = 0, B = 1, and output = 1. Without the specific state transition table, a general approach to such problems involves understanding that the minimum length of the input string is determined by the shortest path through the state diagram that achieves the specified conditions. Given the lack of specific transitions, a hypothetical shortest path could involve an initial state change followed by a direct transition to the desired state, typically achievable within 3 steps in a simple FSM scenario.

State Table of an FSM Is Given Below