GATE CSE 2019 | Finite Automata and Regular Language Question 7 | Theory of Computation

PREVIOUS NEXT

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 2

Numerical

-0

The number of states in the minimum sized $$DFA$$ that accepts the language defined by the regular expression $$${\left( {0 + 1} \right)^ * }\left( {0 + 1} \right){\left( {0 + 1} \right)^ * }$$$
is ___________________.

Your input ____

GATE CSE 2016 Set 2

MCQ (Single Correct Answer)

-0.3

Language $${L_1}$$ is defined by the grammar: $$S{}_1 \to a{S_1}b|\varepsilon $$
Language $${L_2}$$ is defined by the grammar: $$S{}_2 \to ab{S_2}|\varepsilon $$

Consider the following statements:
$$P:$$ $${L_1}$$ is regular
$$Q:$$ $${L_2}$$ is regular

Which one of the following is TRUE?

Both $$P$$ and $$Q$$ are true

$$P$$ is true and $$Q$$ is false

$$P$$ is false and $$Q$$ is true

Both $$P$$ and $$Q$$ are false

PREVIOUS NEXT