Time Left - 15:00 mins
GATE Prev Year : Theory of Computation-7
Attempt now to get your rank among 898 students!
Question 1
Which one of the following is FALSE?
Question 2
Which of the following pairs have DIFFERENT expressive power?
Question 3
Consider the languages L1, L2 and L3 as given below.
L1 = {0p 1q | p,q ∈ N},
L2 = {0p 1q | p,q ∈ N, and p=q} and
L3 = {0p 1q 0r| p,q,r ∈ N, and p=q=r}
Which of the following statements is NOT TRUE?
L1 = {0p 1q | p,q ∈ N},
L2 = {0p 1q | p,q ∈ N, and p=q} and
L3 = {0p 1q 0r| p,q,r ∈ N, and p=q=r}
Which of the following statements is NOT TRUE?
Question 4
Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable but not recursive language.
Which one of the following statements is false?
Question 5
Consider the machine M:
The language recognized by M is:
The language recognized by M is:
Question 6
The language L = {0i21i| i ≥ 0} over the alphabet {0,1,2} is :
- 898 attempts
- 8 upvotes
- 65 comments
Apr 2GATE & PSU CS
