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 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
If $${L_1} = \left\{ {{a^n}\left| {n \ge \left. 0 \right\}} \right.} \right.$$ and $${L_2} = \left\{ {{b^n}\left| {n \ge \left. 0 \right\}} \right.} \right.,$$ consider
$$\left. {\rm I} \right)$$ $$\,\,\,{L_{1 \bullet }}{L_2}$$ is a regular language
$$\left. {\rm II} \right)$$ $$\,\,\,{L_{1 \bullet }}{L_2} = \left\{ {{a^n}{b^n}\left| {n \ge \left. 0 \right\}} \right.} \right.$$
Which one of the following is CORRECT?
A
Only $$\left( {\rm I} \right)$$
B
Only $$\left( {\rm II} \right)$$
C
Both $$\left( {\rm I} \right)$$ and $$\left( {\rm II} \right)$$
D
Neither $$\left( {\rm I} \right)$$ nor $$\left( {\rm II} \right)$$
2
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is TRUE?
A
The language $$L = \left\{ {{a^n}\,{b^n}\left| {n \ge 0} \right.} \right\}$$ is regular.
B
The language $$L = \,\,\left\{ {{a^n}\,\left| n \right.\,} \right.$$ is prime$$\left. \, \right\}$$ is regular.
C
The language $$L = \left\{ {w\left| {w\,\,} \right.} \right.$$ has $$3k+1$$ $$b'$$ $$s$$ for some $$k \in N$$ with $$\sum { = \left\{ {a,\,\,b} \right\}\left. \, \right\}} $$ is regular.
D
The language $$L = \left\{ {ww\,\left| {w \in \sum {{}^ * } } \right.} \right.$$ with $$\sum { = \left. {\left\{ {0,\,\,1} \right\}} \right\}} $$ is regular.
3
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Consider the finite automation in the following figure. GATE CSE 2014 Set 1 Theory of Computation - Finite Automata and Regular Language Question 90 English

What is the set of reachable states for the input string $$0011?$$

A
$$\left\{ {{q_0},\,{q_1},\,{q_2}} \right\}$$
B
$$\left\{ {{q_0},\,{q_1}} \right\}$$
C
$$\left\{ {{q_0},\,{q_1},\,{q_2},\,{q_3}} \right\}$$
D
$$\left\{ {{q_3}} \right\}$$
4
GATE CSE 2013
MCQ (Single Correct Answer)
+1
-0.3
Consider the languages $${L_1} = \phi $$ and $${L_2} = \left\{ a \right\}.$$ Which one of the following represents $${L_1}\,L_2^ * UL_1^ * ?$$
A
$$\left\{ \varepsilon \right\}$$
B
$$\phi $$
C
$${a^ * }$$
D
$$\left\{ {\varepsilon ,a} \right\}$$
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