Multiple Choice
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
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q3: The symbols that can't be replaced by
Q4: Let n be the positive integer constant
Q5: Which of the following statement is false
Q6: Consider a stack, which is limited to
Q7: Which of the following will be used
Q9: Which of the following instances of the
Q10: Left hand side of a production in
Q11: Consider a graph G = (V, E)
Q12: Let FHAM be the problem of finding
Q13: If r1 = (aa + bb) and