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
Previous Next
1
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 ____
2
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
Which one of the following regular expressions represents the set of all binary strings with an odd number of 1’s?
A
10*(0*10*10*)*
B
((0 + 1)*1(0 + 1)*1)*10*
C
(0*10*10*)*10*
D
(0*10*10*)*0*1
3
GATE CSE 2020
MCQ (Single Correct Answer)
+1
-0.33
Consider the following statements.

I. If L1 $$ \cup $$ L2 is regular, then both L1 and L2 must be regular.

II. The class of regular languages is closed under infinite union.

Which of the above statements is/are TRUE?
A
I only
B
II only
C
Both I and II
D
Neither I nor II
4
GATE CSE 2019
MCQ (Single Correct Answer)
+1
-0.33
If L is a regular language over Σ = {a, b}, which one of the following languages is NOT regular?
A
Suffix (L) = {y ∈ Σ* such that xy ∈ L}
B
{wwR │w ∈ L}
C
Prefix (L) = {x ∈ Σ*│∃y ∈ Σ* such that xy ∈ L}
D
L ∙ LR = {xy │ x ∈ L, yR ∈ L}
Previous 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