Prove that the union of two regular languages is regular


Prove that the union of two regular languages is regular using these two facts:

  1. Given 2 regular languages, their intersection is regular
  2. A compliment of a regular language is regular

Solution Preview :

Prepared by a verified Expert
Basic Computer Science: Prove that the union of two regular languages is regular
Reference No:- TGS02492501

Now Priced at $10 (50% Discount)

Recommended (99%)

Rated (4.3/5)