Time Left - 10:00 mins

GATE 2020 : Theory of Computation Quiz 5

Attempt now to get your rank among 649 students!

Question 1

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

Question 2

If L1 is DCFL and L2 is CFL , then which statement is true :

Question 3

Consider the following statements :
S1 : DCFL's are closed under complement
S2 : DCFL's are closed under Homomorphism
S3 : DCFL's are closed under union with regular
Which option is correct ?

Question 4

Consider a Language L which is made by alphabets 0's and 1's. The language satisfies the below property :

" and L , x should not be a prefix of y."

If the above property is satisfies then the language L is :

Question 5

Consider the following operations.
(i) Reversal
(ii) Positive closure
(iii) Difference
How many of the above operations are not closed for DCFLs?

Question 6

Which of the following operations is not closed for recursively enumerable languages?
  • 649 attempts
  • 5 upvotes
  • 3 comments
Oct 14GATE & PSU CS