Consider the following DFA that generates set of strings over Σ = {a, b, c}…

PYQ UGC NET 2025

Consider the following DFA that generates set of strings over Σ = {a, b, c}

image.png


Now identify that which of the followings is the best description of the language for the above DFA:

  1. A.

    L = (a* + b* + c*)*

  2. B.

    L = (a + b + c)(abc)(a + b + c)*

  3. C.

    L = {Set of strings, all starting with ‘a, b, c’ but ending with ‘c’}

  4. D.

    L = {Set of strings, all having even count (including 0) of substring ‘abc’}

Attempted by 95 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…