If S and T be language over Σ = {a, b } represented by regular expression (a + b * ) * and (a + b) * , respectively, then
| A. | S ⊂ T |
| B. | T⊂ S |
| C. | S = T |
| D. | S ∩ T= φ |
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. |
