UGC-NET | UGC NET CS 2018 Dec – II | Question 74

Consider the language L given by

L = { 2nk | k > 0 , and n is non − negative integer number } 

The minimum number of states of finite automaton which accept the language L is
(A) n
(B) n+1
(C) 2ⁿ
(D) n (n + 1 )/2


Answer: (B)

Explanation:

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

My Personal Notes arrow_drop_up

Save