DFA Union Property

We have following operations defined over DFA's

  1. Union
  2. Concatination
  3. Cross Product Method
  4. Complemetaion
  5. Reversal

Union of DFAs

In this property we say that union of two DFAs are also a DFA
or
Unions of two DFAs will lead to combine the languages respresented by them


We will explain union using one example, (we already have explained the below DFA)


So as you see in the above picture, we have taken two DFAs
  1. Starts with 'a' and ends with 'b'
  2. Starts with 'b' and ends with 'a'
Languages represented by them are respectively
  1. L1 = {ab, aab, abb, ... }
  2. L2 = {ba, baa, bba, ... }

After taking union new language became "Starting and ending with different symbol
As, L = {ab, aab, abb, ba, baa, bba, ....}
Note: clearly the language is infinite
You can also take some examples from the previous exercises for practice.