Question

show that regular languages are closed under union and concatenation operation

Answer 1

One of the main properties of languages we are interested in are closure properties, and the fact that regular languages are closed under union, intersection, complement, concatenation, and star (and also under homomorphism). But showing closure of DFA under concatenation and £ is hard.