Time Left - 15:00 mins
GATE CS 2022 : Theory of Computation-3 (App update required to attempt this test)
Attempt now to get your rank among 160 students!
Question 1
Regular languages are closed under?
Question 2
Which of the following language is CFL?
Question 3
Which of the following languages are context-free?
L1= {ambnanbm|m,n≥1}
L2= {ambnambn|m,n≥1}
L3= {am bn | m=2n+1}
L1= {ambnanbm|m,n≥1}
L2= {ambnambn|m,n≥1}
L3= {am bn | m=2n+1}
Question 4
Let and to be two languages. Which among the following options is not true?
Question 5
The number of expressions same as a* are
I. Ɛ + aa*
II. aa* + Ɛ
III. aa*
IV. aa* + a*a + Ɛ
Question 6
Find the number of states in minimal FA for the following language :
L = {(a+b)* | number of a's = (0 mod 4) and (0 mod 8)}
- 160 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSGeneralAug 17GATE & PSU CS