Answer: True
Explanation: Regular language is the language that is determined and expression with the regular expression and function.A regular language is said to be finite in every phase and accepted by the DFA (deterministic finite automata) as well as the other automation.It is factually seen that it comes under the intersection panel and that is of the union and the complementation. Therefore, the given statement is true.