DFA Union Property
We have following operations defined over DFA's
- Union
- Concatination
- Cross Product Method
- Complemetaion
- 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)
![](images/DFA-union-property.png)
So as you see in the above picture, we have taken two DFAs
- Starts with 'a' and ends with 'b'
- Starts with 'b' and ends with 'a'
- L1 = {ab, aab, abb, ... }
- 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.