COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
open
|
|
|
closed
|
|
|
decidable
|
|
|
none of the mentioned
|
Detailed explanation-1: -Regular Languages are closed under intersection, i.e., if L1 and L2 are regular then L1 ∩ L2 is also regular. L1 and L2 are regular • L1 ∪ L2 is regular • Hence, L1 ∩ L2 = L1 ∪ L2 is regular.
Detailed explanation-2: -If L1 and L1 ∪ L2 are regular languages, then L2 is a regular language. Answer The statement is false.
Detailed explanation-3: -(1) If L1 ∪ L2 is regular and L1 is finite, then L2 is regular. TRUE. Because L2 = (L1 ∪L2)−(L1 −L2). The first part is regular by assumption, the second part is regular because it is finite (being a finite set minus something), and regular languages are closed under set difference.
Detailed explanation-4: -Answer: Answer: If L1 and L2 are regular languages, then these can be expressed by the corresponding FAs. Regular Expression for the language of words containing even number of a’s is? The language that can be expressed by any regular expression is called a regular language.
Detailed explanation-5: -Regular languages are closed under union, concatenation, star, and complementation.