20) If Σ = (0, 1), L = Σ* and R = (0n 1nsuch that n > 0 ) then languages L ∪R and R respectively are
Answer is:
Regular, Not regular
Related Theory of Computation MCQ with Answers
Answer is:
All of these
Explanation:
Set of regular languages over a given alphabet set is not closed under
* union
* complementation
* intersection
Answer is:
both 1) Any regular language has an equivalent CFG and 2) Some non regular languages can't be generated by CFG
Answer is: