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 2008
MCQ (Single Correct Answer)
+2
-0.6
Which of the following statement is false?
A
Every $$NFA$$ can be converted to an equivalent $$DFA$$
B
Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine.
C
Every regular language is also a context- free language
D
Every subset of a recursively enumerable set is recursive
2
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the $$CFG$$ with $$\left\{ {S,A,B} \right\}$$ as the non-terminal alphabet, $$\left\{ {a,b} \right\}$$ as the terminal alphabet, $$S$$ as the start symbol and the following set of production rules: GATE CSE 2007 Theory of Computation - Push Down Automata and Context Free Language Question 36 English

For the correct string of (earlier question) how many derivation trees are there?

A
$$1$$
B
$$2$$
C
$$3$$
D
$$4$$
3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
The language $$L = \left\{ {{0^i}{{21}^i}\,|\,i \ge 0} \right\}$$ over the alphabet $$\left\{ {0,1,2} \right\}$$ is
A
Not recursive.
B
is recursive and is a deterministic $$CFL$$.
C
is a regular language.
D
is not a deterministic $$CFL$$ but a $$CFL$$.
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the $$CFG$$ with $$\left\{ {S,A,B} \right\}$$ as the non-terminal alphabet, $$\left\{ {a,b} \right\}$$ as the terminal alphabet, $$S$$ as the start symbol and the following set of production rules: GATE CSE 2007 Theory of Computation - Push Down Automata and Context Free Language Question 37 English

Which of the following strings is generated by the grammar?

A
$$aaaabb$$
B
$$aabbbb$$
C
$$aabbab$$
D
$$abbbba$$
Previous Next
Questions Asked from Marks 2
GATE CSE 2025 Set 1 (1) GATE CSE 2024 Set 2 (1) GATE CSE 2024 Set 1 (1) GATE CSE 2023 (2) GATE CSE 2022 (2) GATE CSE 2021 Set 2 (1) GATE CSE 2021 Set 1 (1) GATE CSE 2020 (1) GATE CSE 2019 (1) GATE CSE 2018 (1) GATE CSE 2016 Set 1 (1) GATE CSE 2015 Set 3 (1) GATE CSE 2014 Set 3 (1) GATE CSE 2013 (1) GATE CSE 2011 (1) GATE CSE 2010 (1) GATE CSE 2008 (3) GATE CSE 2007 (3) GATE CSE 2006 (1) GATE CSE 2005 (3) GATE CSE 2004 (3) GATE CSE 1999 (1) GATE CSE 1998 (2) GATE CSE 1997 (1) GATE CSE 1996 (2) GATE CSE 1994 (1) GATE CSE 1992 (1) GATE CSE 1989 (1) GATE CSE 1987 (2)
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