Consider the language \(L\) given by \(L=\{ 2^{nk} \mid k >0, \text{ and n is…
PYQ UGC NET 2018Modified — slightly modified from the official paper; see the solution
Consider the language given by
The minimum number of states of finite automaton which accepts the language is
- A.
- B.
- C.
- D.
Attempted by 232 students.
Sign up free to check your answer
Sign up freeLoading lesson…

