1

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 2^{n} states

2

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.

3

GATE CSE 1990

True or False

+1

-0

State whether the following statement is TRUE / FALSE.

A is recursive if both a and its complement are accepted by Turing Machine M accepts.

4

GATE CSE 1990

True or False

+1

-0

State whether the following statement is TRUE / FALSE.

The intersection of two $$CFL's$$ is also $$CFL.$$

Questions Asked from Push Down Automata and Context Free Language (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude