If 𝐿 is a regular language over Σ = {𝑎, 𝑏}, which one of the following…

PYQ GATE 2019

If 𝐿 is a regular language over Σ = {𝑎, 𝑏}, which one of the following languages is NOT regular ?

  1. A.

    L.LR={xy∣x∈L,yR∈L}L.L^R = \{xy \mid x \in L , y^R \in L\}

  2. B.

    {wwR∣w∈L}\{ww^R \mid w \in L \}

  3. C.

    Prefix (L)={x∈Σ∗∣∃y∈Σ∗\text{Prefix } (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^*  such that 𝑥𝑦∈𝐿}𝑥𝑦 ∈ 𝐿 \}

  4. D.

    Suffix (L)={y∈Σ∗∣∃x∈Σ∗\text{Suffix }(L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* such that 𝑥𝑦∈𝐿}𝑥𝑦 ∈ 𝐿 \}

Attempted by 341 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…