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 18 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 2021 Set 2
MCQ (Single Correct Answer)
+1
-0.33
Let L ⊆ {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states? 
A
{0,1}* - L
B
L.L
C
L - {01}
D
L ∪ {01}
3
GATE CSE 2021 Set 2
Numerical
+1
-0

Consider the following deterministic finite automaton (DFA).

GATE CSE 2021 Set 2 Theory of Computation - Finite Automata and Regular Language Question 22 English

The number of strings of length 8 accepted by  the above automaton is __________

Your input ____
4
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
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP