Is the union between a regular language and a random language also a regular language? If not can we draw any conclusion about the newly fromed language, the language that represents the union between a regular language and a non regular language  (not context free but a truly random language ).
The empty language is certainly regular. Take its union with any non-regular language $N$. What's the result?