Question

Show that class of regular languages is closed under the union operation. In other words if A1 and A2 are the regular languages, so is A1 union A2 (A1UA2)​

Answer 1

Answer:

Theorem: The class of regular languages over fixed alphabet Σ is closed under the union operation. Proof: Let A1, A2 be any two regular ...