Environment
October 3, 2023October 3, 2023
GATE 2019
Question 11
|
If L is a regular language over Σ = {a,b}, which one of the following languages is NOT regular?
Suffix (L) = {y ∈ Σ* such that xy ∈ L}
|
|
{wwR │w ∈ L}
|
|
Prefix (L) = {x ∈ Σ*│∃y ∈ Σ* such that xy ∈ L}
|
|
L ∙ LR = {xy │ x ∈ L, yR ∈ L}
|
Question 11 Explanation:
wwR cannot be recognized without using stack, so it cannot be regular.
Correct Answer: B
Question 11 Explanation:
wwR cannot be recognized without using stack, so it cannot be regular.
Subscribe
Login
0 Comments