Time Left - 15:00 mins
GATE CS 2021 : Theory of computation Quiz 5
Attempt now to get your rank among 635 students!
Question 1
If
and
Consider
I.
is a regular language
II.
Which one of the following is CORRECT?
![](https://gradeup-question-images.grdp.co/liveData/PROJ7291/1503644695158881.png)
![](https://gradeup-question-images.grdp.co/liveData/PROJ7291/1503644695949442.png)
I.
![](https://gradeup-question-images.grdp.co/liveData/PROJ7291/1503644696738759.png)
II.
![](https://gradeup-question-images.grdp.co/liveData/PROJ7291/1503644697525813.png)
Which one of the following is CORRECT?
Question 2
Which of the following is neither closed by DCFL nor by CFL?
Question 3
Let L1 = ϕ, L2 = {(a + b)*} and L3 = {a*}. Languages L1, L2 and L3 are defined over ∑ = {a, b}. What is the language ‘L’ represented by the following closure operations ?
![](https://gs-post-images.grdp.co/2022/6/1-img1655803410794-70.jpg-rs-high-webp.jpg)
Question 4
For the following set of languages, which options holds true?
![](https://gradeup-question-images.grdp.co/liveData/PROJ5528/1501247974270156.png)
![](https://gradeup-question-images.grdp.co/liveData/PROJ5528/1501247975045866.png)
![](https://gradeup-question-images.grdp.co/liveData/PROJ5528/1501247975825889.png)
![](https://gradeup-question-images.grdp.co/liveData/PROJ5528/1501247976602879.png)
Question 5
Consider the following language L1 and L2.
L1 = {am bn | m, n ≥ 0}
L2 = {am bn | m = n}
If , then what is the language L?
Question 6
Let language
be a CFL and
is DCFL. If L = L1 ∩ Complement(L2) then which of the following is true for L?
![](https://gradeup-question-images.grdp.co/liveData/PROJ4749/149543841429646.png)
![](https://gradeup-question-images.grdp.co/liveData/PROJ4749/1495438415005761.png)
- 635 attempts
- 5 upvotes
- 10 comments
Dec 22GATE & PSU CS