ExamSIDE
Questions (Powered by ExamGOAL)
Theory of Computation
Finite Automata and Regular Language
Marks 1Marks 2Marks 5
Push Down Automata and Context Free Language
Marks 1Marks 2
Undecidability
Marks 1Marks 2
Recursively Enumerable Language and Turing Machine
Marks 1Marks 2
Next
1
GATE CSE 2025 Set 1
MCQ (Single Correct Answer)
+1
-0

A regular language $L$ is accepted by a non-deterministic finite automaton (NFA) with $n$ states. Which of the following statement(s) is/are FALSE?

A
$L$ may have an accepting NFA with $< n$ states.
B
$L$ may have an accepting DFA with $< n$ states.
C
There exists a DFA with $\leq 2^n$ states that accepts $L$.
D
Every DFA that accepts $L$ has $>2^n$ states.
2
GATE CSE 2024 Set 2
MCQ (Single Correct Answer)
+1
-0.33

Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?

GATE CSE 2024 Set 2 Theory of Computation - Finite Automata and Regular Language Question 10 English

A

0*1(0 + 10*1)*

B

0*(10*11)*0*

C

0*1(010*1)*0*

D

0(1 + 0*10*1)*0*

3
GATE CSE 2024 Set 1
MCQ (More than One Correct Answer)
+1
-0

Let $L_1, L_2$ be two regular languages and $L_3$ a language which is not regular. Which of the following statements is/are always TRUE?

A

$L_1 = L_2$ if and only if $L_1 \cap \overline{L_2} = \emptyset$

B

$L_1 \cup L_3$ is not regular

C

$\overline{L_3}$ is not regular

D

$L_1 \cup \overline{L_2}$ is regular

4
GATE CSE 2023
MCQ (Single Correct Answer)
+1
-0.33

Consider the Deterministic Finite-state Automation (DFA) $$A$$ shown below. The DFA runs on the alphabet {0, 1}, and has the set of states {$$s,p,q,r$$}, with $$s$$ being the start state and $$p$$ being the only final state.

GATE CSE 2023 Theory of Computation - Finite Automata and Regular Language Question 17 English

Which one of the following regular expressions correctly describes the language accepted by $$A$$?

A
$$1(0^*11)^*$$
B
$$0(0+1)^*$$
C
$$1(0+11)^*$$
D
$$1(110^*)^*$$
Next
Questions Asked from Marks 1
GATE CSE 2025 Set 1 (1) GATE CSE 2024 Set 2 (1) GATE CSE 2024 Set 1 (1) GATE CSE 2023 (3) GATE CSE 2022 (1) GATE CSE 2021 Set 2 (2) GATE CSE 2020 (2) GATE CSE 2019 (2) GATE CSE 2016 Set 2 (2) GATE CSE 2016 Set 1 (1) GATE CSE 2015 Set 3 (1) GATE CSE 2014 Set 3 (1) GATE CSE 2014 Set 2 (1) GATE CSE 2014 Set 1 (2) GATE CSE 2013 (1) GATE CSE 2012 (1) GATE CSE 2010 (1) GATE CSE 2009 (1) GATE CSE 2003 (2) GATE CSE 2001 (2) GATE CSE 2000 (2) GATE CSE 1999 (1) GATE CSE 1998 (4) GATE CSE 1997 (1) GATE CSE 1996 (2) GATE CSE 1994 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization