FLAT S10 QUIZ
Authored by Asst.Prof.,CSE Vel Tech, Chennai
Engineering
University
Used 2+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
5 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which of the following is equivalent to the set described by the regular expression 11∗00∗?
{1m0m|m>0 is a natural number}
{1m0n|m,n>0 are natural numbers}
{1m0m|m≥0 is a natural number}
{1m0n|m,n≥0 are natural numbers}
2.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Any regular expression of size n can be converted to an NFA (with ϵ-transitions) having at most (select the smallest possible asymptotic upper bound)
O(n) states
O(n2) states
O(2n) states
O(1) states
3.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Which of the following regular expressions generates the complement of the language generated the regular expression (00+11)∗?
(00+11)∗(0+1)+(00+11)∗(01+10)(0+1)∗
(00+11)(0+1)∗+0(00)∗+1(11)∗
(01+10)(0+1)∗+0+1
(00+11)(0+1)∗+(0+1)(01+10)∗
4.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
Let R and S be two regular expressions. Which of the following is equivalent to the regular expression S(S+RS)∗?
R(SR+R)∗
(RR∗S∗S∗)∗
(S+SR)∗R
RR∗S(RR∗S)∗
5.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
The union of two decidable languages is
context-free but not necessarily regular
regular
decidable but not necessarily context-free
recognizable but not necessarily decidable
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
