GATE CS Applied Course

Theory of Computation


0

Let L be a regular language and R be a context-free language, both over the alphabet ? . Let L' and R' denote the complements of and respectively. Which of the following statements about the language L' U M'is TRUE? (a) It is necessarily regular but not necessarily context free (b) It is necessarily context free (c) It is necessarily non-regular (d) None of the above.

Answers

© 2020 - All rights are reserved- AAIC Technologies pvt ltd