1
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 3 English Option 1
B
GATE CSE 2021 Set 1 Theory of Computation - Finite Automata and Regular Language Question 3 English Option 2
C
GATE CSE 2021 Set 1 Theory of Computation - Finite Automata and Regular Language Question 3 English Option 3
D
GATE CSE 2021 Set 1 Theory of Computation - Finite Automata and Regular Language Question 3 English Option 4
2
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 ____
3
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}$$
4
GATE CSE 2018
Numerical
+2
-0
Given a language $$𝐿,$$ define $${L^i}$$ as follows: $${L^0} = \left\{ \varepsilon \right\}$$
$${L^i} = {L^{i - 1}}.\,\,L$$ for all $$i > 0$$

The order of a language $$L$$ is defined as the smallest k such that $${L^k} = {L^{k + 1}}.$$ Consider the language $${L_1}$$ (over alphabet $$0$$) accepted by the following automaton.

GATE CSE 2018 Theory of Computation - Finite Automata and Regular Language Question 9 English

The order of $${L_1}$$ 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
CBSE
Class 12