1
GATE CSE 2023
MCQ (More than One Correct Answer)
+1
-0

Which of the following statements is/are CORRECT?

A
The intersection of two regular languages is regular.
B
The intersection of two context-free languages is context-free.
C
The intersection of two recursive languages is recursive.
D
The intersection of two recursively enumerable languages is recursively enumerable.
2
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*)
3
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}
4
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 ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP