Regular Language and Finite Automata|| (1 Mark)||MCQ||2019

Last Updated :
Discuss
Comments

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

[GATE 2019||MCQ|| 1-mark]


Suffix (L) = {y ϵ Σ* such that xy ϵ L}

{wwR | w ϵ L}

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

L.L R = {xy | x ϵ L, yR ϵ L}

This question is part of this quiz :

GATE||Regular Language and Finite Automata|| Pyq (2010 to2025),GATE||TOC || Pyq (2010 to2025)
Tags:
GATE CS
Theory of Computation
GATE CS
Share your thoughts in the comments
Article Tags :