GATE CS Regular and Context-free Languages questions

Practise Regular and Context-free Languages questions for GATE CS. Explore official PYQs and original topic-wise quizzes, check answers and view available solutions. Free, no sign-in.

11 on this page

SubjectTopicYearType

Which of the following statements is false?

Given

\Sigma=\{a,b\}

, which one of the following sets is not countable?

Let

L \subseteq \Sigma^*

where

\Sigma = \left\{a,b \right\}

. Which of the following is true?

Let

\Sigma=\left\{0,1\right\}, L = \Sigma^*

and

R=\left\{0^n1^n \mid n > 0\right\}

then the languages

L \cup R

and

R

are respectively

Which of the following three statements are true? Prove your answer.

Which of the following is the strongest correct statement about a finite language over some finite alphabet

\Sigma?

Let

R_{1}

and

R_{2}

be regular sets defined over the alphabet

\Sigma

Then:

Context-free languages and regular languages are both closed under the operation (s) of :

State whether the following statements are TRUE or FALSE: Regularity is preserved under the operation of string reversal.

State whether the following statements are TRUE or FALSE: All subsets of regular sets are regular.

FORTRAN is a: