title: What is the minimum number of states to recognize this language?
body: <p>Definition of a language L with alphabet {a} is as follows:</p>
  <blockquote>
  <p>L= { a^{nk} | k &gt; 0,n &gt;0}.</p>
  </blockquote>
  <p>There were four options to this question</p>
  <blockquote>
  <p>k+1</p>
  <p>n+1</p>
  <p>2^(n+1)</p>
  <p>2^(k+1)</p>
  </blockquote>
  <p>k &gt; 0, and n is a positive integer constant</p>