If e1 and e2 are the regular expressions denoting the languages L1 and L2 respectively, then which of the following is wrong ?
| A. | (e1) | (e2) is a regular expression denoting L1 ∪ L2 |
| B. | (e1) .(e2) is a regular expression denoting L1. L2 |
| C. | φ is not a regular expression |
| D. | {ex} is a regular expression denoting L1* |
Answer : C Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
