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
1
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
Which of the following conversions is not possible (algorithmically)?
A
Regular grammar to context free grammar
B
Non-deterministic $$FSA$$ to deterministic $$FSA$$
C
Non-deterministic $$PDA$$ to deterministic $$PDA$$
D
Non-deterministic Turing machine to deterministic Turing machine
2
GATE CSE 1992
MCQ (More than One Correct Answer)
+2
-0
In which of the cases stated below is the following statement true?
“For every non-deterministic machine $${M_1}$$ there exists an equivalent deterministic machine $${M_2}$$ recognizing the same language“.
A
$${M_1}$$ is nondeterministic finite automation
B
$${M_1}$$ is a nondeterministic $$PDA$$
C
$${M_1}$$ is a non-deterministic Turing machine
D
For no machine $${M_1}$$ use the above statement true
3
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
Recursive languages are:
A
A proper superset of context free languages.
B
Always recognizable by pushdown automata.
C
Also called Type $$(0)$$ languages.
D
Recognizable by Turing machines.
Previous
Questions Asked from Marks 2
GATE CSE 2022 (1) GATE CSE 2021 Set 1 (1) GATE CSE 2019 (1) GATE CSE 2018 (2) GATE CSE 2016 Set 2 (1) GATE CSE 2016 Set 1 (1) GATE CSE 2014 Set 2 (1) GATE CSE 2014 Set 1 (1) GATE CSE 2008 (1) GATE CSE 2006 (2) GATE CSE 2005 (1) GATE CSE 2003 (2) GATE CSE 2002 (2) GATE CSE 1997 (1) GATE CSE 1994 (1) GATE CSE 1992 (1) GATE CSE 1990 (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