1
GATE CSE 2022
MCQ (Single Correct Answer)
+1
-0.33

Which one of the following regular expressions correctly represents the language of the finite automation given below?

GATE CSE 2022 Theory of Computation - Finite Automata and Regular Language Question 2 English

A
ab*bab* + ba*aba*
B
(ab*b)* ab* + (ba*a)*ba*
C
(ab*b + ba*a)* (a* + b*)
D
(ba*a + ab*b)* (ab* + ba*)
2
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
Consider the following statements.

I. If L1 $$ \cup $$ L2 is regular, then both L1 and L2 must be regular.
II. The class of regular languages is closed under infinite union.

Which of the above statements is/are TRUE?
A
I only
B
II only
C
Both I and II
D
Neither I nor II
3
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
Which one of the following regular expressions represents the set of all binary strings with an odd number of 1’s?
A
10*(0*10*10*)*
B
((0 + 1)*1(0 + 1)*1)*10*
C
(0*10*10*)*10*
D
(0*10*10*)*0*1
4
GATE CSE 2019
MCQ (Single Correct Answer)
+1
-0.33
If L is a regular language over Σ = {a,b}, which one of the following languages is NOT regular?
A
Suffix (L) = {y ∈ Σ* such that xy ∈ L}
B
{wwR │w ∈ L}
C
Prefix (L) = {x ∈ Σ*│∃y ∈ Σ* such that xy ∈ L}
D
L ∙ LR = {xy │ x ∈ L, yR ∈ L}
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12