Time Left - 15:00 mins
GATE CS 2022: Theory of computation-2 (App update required to attempt this test)
Attempt now to get your rank among 315 students!
Question 1
Recursive enumerable languages are not closed under ______.
Question 2
The number of prefixes in the string "abbab" are____.
Question 3
A regular expression is (a + b*c) is equivalent to :
Question 4Multiple Correct Options
L= {
| n,m>= 1 } which of the following is grammar of L
| n,m>= 1 } which of the following is grammar of L
Question 5
Consider the following languages
1) L1={anbncm/n>m}
2) L2 = {xcy/x,y € (0,1)*}
3) L3 = { aibjck /j=i+k}
4) L4= {w / w € (a,b) , na(w) >= nb(w)+1}
Number of languages that are Deterministic CFL ___.
Question 6
Consider the following DFA D.
The number of states in the minimization of D are _________.
- 315 attempts
- 1 upvote
- 6 comments
Jun 8GATE & PSU CS
