Which of the following languages can NOT be recognized by any DFA, due to a…

GSET 2025

Which of the following languages can NOT be recognized by any DFA, due to a structural requirement that exceeds finite memory ?

  1. A.

    {a^nb^n | n ≥ 0}

  2. B.

    {w ∈ {a, b}^* | w ends with ab}

  3. C.

    {a^n | n is even}

  4. D.

    {w ∈ {a, b}^* | w contains no aa}

Attempted by 11 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…