The regular sets are closed under
A. | union |
B. | concatenation |
C. | Kleene's closure |
D. | all of these |
Option: D Explanation : Click on Discuss to view users comments. |
Dynamic errors can be detected at
A. | compile time |
B. | Run time |
C. | both (a) and (b) |
D. | none of these |
Option: B Explanation : Click on Discuss to view users comments. |
If a and b be the regular expressions, then ( a* ∪ b* ) * is equivalent to
A. | (a ∪ b) * |
B. | (b* ∪ a*)* |
C. | (b ∪ a)* |
D. | All of above |
Option: D Explanation : Click on Discuss to view users comments. T. Sudhakar said: (6:08pm on Thursday 11th August 2016)
options B and C are also correct.All generating zero or more number of a's and b's
|