1
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 ___________.

2
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
B
C
D
3
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 ______.
4
GATE CSE 2018
MCQ (Single Correct Answer)
+2
-0.6
Let $$N$$ be an $$NFA$$ with $$n$$ states. Let $$k$$ be the number of states of a minimal $$DFA$$ which is equivalent to $$N.$$ Which one of the following is necessarily true?
A
$$k \ge {2^n}$$
B
$$k \ge n$$
C
$$k \le {n^2}$$
D
$$k \le {2^n}$$
GATE CSE Subjects
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12