Time Left - 15:00 mins

GATE CS 2021 : Theory of computation Quiz 5

Attempt now to get your rank among 635 students!

Question 1

and

Consider
I.

is a regular language
II.

Which one of the following is CORRECT?

Question 2

Which of the following is neither closed by DCFL nor by CFL?

Question 3

Let L₁ = ϕ, L₂ = {(a + b)*} and L₃ = {a*}. Languages L₁, L₂ and L₃ are defined over ∑ = {a, b}. What is the language ‘L’ represented by the following closure operations ?

Question 4

For the following set of languages, which options holds true?

Question 5

Consider the following language L₁ and L₂.

L₁ = {a^m bⁿ | m, n ≥ 0}

L₂ = {a^m bⁿ | m = n}

If , then what is the language L?

Question 6

Let language

be a CFL and

is DCFL. If L = L₁∩ Complement(L₂) then which of the following is true for L?

635 attempts
5 upvotes
10 comments

Tags :

GATE & PSU CS Theory of Computation

Dec 22GATE & PSU CS