If L is a regular language over Σ = {a, b}, which one of the following…

HPSC Teaching and Computer Science 2022

If L is a regular language over Σ = {a, b}, which one of the following languages is not regular?

  1. A.

    L · Lᴿ = {xy | x ∈ L, yᴿ ∈ L}

  2. B.

    Suffix(L) = {y ∈ Σ* | ∃x ∈ Σ* such that xy ∈ L}

  3. C.

    Prefix(L) = {x ∈ Σ* | ∃y ∈ Σ* such that xy ∈ L}

  4. D.

    {wwᴿ | w ∈ L}

Attempted by 247 students.

Sign up free to check your answer

Sign up free

Explore the full course: Bpsc

Loading lesson…