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 LL given by

L={2nk∣k>0, and n is non-negative integer number }L=\{ 2^{nk} \mid k >0, \text{ and n is non-negative integer number } \}

The minimum number of states of finite automaton which accepts the language LL is

  1. A.

    nn

  2. B.

    n+1n + 1

  3. C.

    n(n+1)2\frac{n(n+1)}{2}

  4. D.

    2n2^n

Attempted by 232 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…