Which of the following is the correct regular expression that can be generated by the given grammar? S - AS | D A -› CaCaC C - aC | bC | & D - bD | 8 Select the correct Options: A. (b*ab*ab*)* + bt B. ((a+b)*a(a+b)*a(a+b)*)* + b* C. (b*ab*ab*)*b* D. ((a+b)*a(a+b)*a(a+b)*)*b*+ b* 2. What is the minimum number of states in DFA over alphabet {a,b) and language L = (a, b, ab, bab, abab}? Select the correct Options: A. 5
PLEASE SUBMIT THE CORRECT OPTION IF YOU DON'T KNOW THE CORRECT OPTION SKIP THE QUESTION, IF YOU GIVE THE INCORRECT SOLUTION I WILL DOWNVOTE IT AND GIVE SOLUTION TO ALL THE QUESTION DO NOT FORGET ANY QUESTION...THANKS!
1. Which of the following is the correct regular expression that can be generated by the
given grammar?
S - AS | D
A -› CaCaC
C - aC | bC | &
D - bD | 8
Select the correct Options:
A. (b*ab*ab*)* + bt
B. ((a+b)*a(a+b)*a(a+b)*)* + b*
C. (b*ab*ab*)*b*
D. ((a+b)*a(a+b)*a(a+b)*)*b*+ b*
2. What is the minimum number of states in DFA over alphabet {a,b) and language L = (a, b, ab, bab, abab}? Select the correct Options: A. 5
B. 6
C. 7
D. 8
3. The main() method can be written only one time in a Java console application.
(a) True
(b) False
4. Assume that the given code runs without any errors and the value of variables used in the code are y1=22, y2=11, and y3=12. What will be the output of the following C++ code? yl = y2++; y2 = --у3; у3 = ylty2+3+++2++; cout << yl << y2 << y3; Select the correct option: A. 111245
B. 111144
C. 111244
D. 111145
5.T (n) = (2n-m+2) (m+1) /2 What does the time complexity of the lower bound of T(n)? Select the correct Options: A. © (2n)
B. © (nm)
C. O (m^2)
D.O (m^2 (log n) )
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
