GATE CSE 2020 | Finite Automata and Regular Language Question 26 | Theory of Computation

GATE CSE 2020

MCQ (Single Correct Answer)

-0.33

Consider the following statements.

I. If L₁ $$ \cup $$ L₂ is regular, then both L₁ and L₂ must be regular.

II. The class of regular languages is closed under infinite union.

Which of the above statements is/are TRUE?

I only

II only

Both I and II

Neither I nor II

GATE CSE 2019

MCQ (Single Correct Answer)

-0.33

If L is a regular language over Σ = {a, b}, which one of the following languages is NOT regular?

Suffix (L) = {y ∈ Σ* such that xy ∈ L}

{ww^R │w ∈ L}

Prefix (L) = {x ∈ Σ*│∃y ∈ Σ* such that xy ∈ L}

L ∙ L^R = {xy │ x ∈ L, y^R ∈ L}

GATE CSE 2019

MCQ (Single Correct Answer)

-0.33

For Σ = {a, b}, let us consider the regular language L = {x | x = a^2+3k or x = b^10+12k, k ≥ 0}. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

-0.3

Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $$0s$$ and two consecutive $$1s?$$

$$\left( {0 + 1} \right){}^ * 0011\left( {0 + 1} \right){}^ * + \left( {0 + 1} \right){}^ * 1100\left( {0 + 1} \right){}^ * $$

$$\left( {0 + 1} \right){}^ * \left( {00\left( {0 + 1} \right){}^ * 11 + 11\left( {0 + 1} \right){}^ * \left. {00} \right)} \right.\left( {0 + 1} \right){}^ * $$

$$\left( {0 + 1} \right){}^ * 00\left( {0 + 1} \right){}^ * + \left( {0 + 1} \right){}^ * 11\left( {0 + 1} \right){}^ * $$

$$00\left( {0 + 1} \right){}^ * 11 + 11\left( {0 + 1} \right){}^ * 00$$

PREVIOUS NEXT