1
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.
All subjects of regular sets are regular.
2
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.
A minimal $$DFA$$ that is equivalent to an $$NFDA$$ with $$n$$ modes has always 2n states
3
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.
Regularity is preserved under the operation of string reversal.
4
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.
The problem is to whether a Turing Machine M accepts input $$w$$ is un-decidable.
Questions Asked from Push Down Automata and Context Free Language (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages