Multiple choice

Definition of a language $L$ with alphabet ${a}$ is given as following.

$$ L = \left\{a^{nk} \mid k > 0, :: and :: n \text{ is a positive integer constant} \right\}$$

What is the minimum number of states needed in a DFA to recognize $L$?

  1. k+1

  2. n+1

  3. 2n+1

  4. 2k+1
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Let n = 3 and k=1

(n + 1) states

Keep practicing — related questions