1.

There are exactly __________ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state.(A) 64(B) 56(C) 1024(D) 5832

Answer»


Discussion

No Comment Found

Related InterviewSolutions