UGC-NET | UGC NET CS 2015 Dec – III | Question 27

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: (D)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.