GATE CSE 1999 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Consider the regular expression $$(0+1)(0+1).......n$$ times. The minimum state finite automation that recognizes the language represented by this regular expression contains:

$$n$$ states

$$n+1$$ states

$$n+2$$ states

None of the above

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Context free languages are closed under:

Union, intersection

Union, Kleene closure

Intersection, complement

Complement, Kleene Closure

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Let $${L_D}$$ be the set of all languages accepted by a $$PDA$$ by final state and $${L_E}$$ the set of all languages accepted by empty stack. Which of the following is true?

$${L_D}\,\, = \,\,{L_E}$$

$${L_D}\,\, \supset \,\,{L_E}$$

$${L_D}\,\, \subset \,\,{L_E}$$

None of the above

GATE CSE 1999

MCQ (More than One Correct Answer)

-0.6

If $${L_1}$$ is a context free language and $${L_2}$$ is a regular which of the following is/are false?

$${L_1} - {L_2}$$ is not context free

$${L_1} \cap {L_2}$$ is context free

$$ \sim {L_1}$$ is context free

$$ \sim {L_2}$$ is regular

GATE CSE Papers

2024