GATE CSE 2021 Set 2 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2021 Set 2

MCQ (Single Correct Answer)

-0.33

Let L ⊆ {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states?

{0,1}* - L

L.L

L - {01}

L ∪ {01}

GATE CSE 2021 Set 2

Numerical

-0

Consider the following deterministic finite automaton (DFA).

GATE CSE 2021 Set 2 Theory of Computation - Finite Automata and Regular Language Question 15 English

The number of strings of length 8 accepted by the above automaton is __________

Your input ____

GATE CSE 2021 Set 2

MCQ (More than One Correct Answer)

-0

For a string w, we define wR to be the reverse of w. For example, if w = 01101 then wR = 10110.

Which of the following languages is/are context-free?

{wxwRxR | w, x ∈ {0, 1}*}

{wwRxxR | w, x ∈ {0, 1}*}

{wxwR | w, x ∈ {0, 1}*}

{wxxRwR | w, x ∈ {0, 1}*}

GATE CSE 2021 Set 2

MCQ (More than One Correct Answer)

-0

Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string ∈ divisible by three.

(0 + 1(01*0)*1)*

(0*(1(01*0)*1)*)*

(0 + 11 + 10(1 + 00)*01)*

( 0+ 11 + 11(1 + 00)*00)*

PREVIOUS NEXT

GATE CSE Papers

2024