1
GATE CSE 2024 Set 1
Numerical
+2
-0.66

Consider the following two regular expressions over the alphabet {0,1}:

$$r = 0^* + 1^*$$

$$s = 01^* + 10^*$$

The total number of strings of length less than or equal to 5, which are neither in r nor in s, is ________

Your input ____
2
GATE CSE 2023
Numerical
+2
-0.67

Consider the language L over the alphabet {0, 1}, given below:

$$L = \{ w \in {\{ 0,1\} ^ * }|w$$ does not contain three or more consecutive $$1's\} $$.

The minimum number of states in a Deterministic Finite-State Automaton (DFA) for L is ___________.

Your input ____
3
GATE CSE 2021 Set 1
MCQ (Single Correct Answer)
+2
-0.67

Consider the following language.

L = { w ∈ {0, 1}* | w ends with the substring 011}

Which one of the following deterministic finite automata accepts L?

A
GATE CSE 2021 Set 1 Theory of Computation - Finite Automata and Regular Language Question 9 English Option 1
B
GATE CSE 2021 Set 1 Theory of Computation - Finite Automata and Regular Language Question 9 English Option 2
C
GATE CSE 2021 Set 1 Theory of Computation - Finite Automata and Regular Language Question 9 English Option 3
D
GATE CSE 2021 Set 1 Theory of Computation - Finite Automata and Regular Language Question 9 English Option 4
4
GATE CSE 2020
Numerical
+2
-0.67
Consider the following language.

L = {x $$ \in $$ {a, b}* | number of a’s in x is divisible by 2 but not divisible by 3}

The minimum number of states in a DFA that accepts L is ______.
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12