19) L = (an bn an| n = 1,2,3) is an example of a language that is
Answer is:
both 1) not context free and 2) not context free but whose complement is CF
Related Theory of Computation MCQ with Answers
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
Answer is:
All of these
Explanation:
Set of regular languages over a given alphabet set is not closed under
* union
* complementation
* intersection
Answer is: