If Σ = (0, 1), L = Σ* and R = (0n 1nsuch that n > 0 )
then languages L ∪ R and R respectively are
| A. | Regular, Regular |
| B. | Regular, Not regular |
| C. | Not regular, Not regular |
| D. | None of these |
Answer : B Explanation : Nancy said: (3:48am on Thursday 15th August 2013)
L is regular and R is Context free which is not regular. Regular U CFG => Regular
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
