Skip to content
Related Articles

Related Articles

Improve Article

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

  • Last Updated : 31 May, 2021
Geek Week

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: If no. of states is |Q|=n and no of input alphabet is m then

Total number of finite automation required is (n^(n*m))*2^n

Here n=3, m=2

Therefore 5832

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :