Prerequisite – Design a Finite automta

Let’s understand the intersection of two DFA with an example.

Designing a DFA for the set of string over {0, 1} such that it ends with 01 and has even number 0f 1’s.

There two desired language will be formed:

L_{1}= {01, 001, 101, 0101, 1001, 1101, ....} L_{2}= {11, 011, 101, 110, 0011, 1100, .....}

L = L_{1}and L_{2}= L_{1}∩ L_{2}

**State Transition Diagram for the language L _{1} :**

This is a DFA for language L

_{1}

It accepts all the string that accept 01 at end.

**State Transition Diagram for the language L _{2} :**

This is a DFA for language L

_{2}

It accepts all the string that accept with even number of 1’s.

**State Transition Diagram of L _{1} ∩ L_{2} : **

Intersection of L

_{1}and L

_{2}can be explained by language that a string over {0, 1} accept such that it ends with 01 and has even number of 1’s.

L = L_{1}∩ L_{2}= {1001, 0101, 01001, 10001, ....}

Thus as we see that L_{1} and L_{2} have been combined through intersection process and this final DFA accept all the language that has even number of 1’s and is ending with 01.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Union and Intersection of Regular languages with CFL
- Union process in DFA
- Concatenation process in DFA
- Complementation process in DFA
- Reversal process in DFA
- Turing Machine for language { www | w ∈ {a, b} }
- Turing Machine to accept maximum of two numbers
- NFA for language at least one of the symbols occurring an odd number of times
- NFA which accepts set of strings over an alphabet {0, 1, 2} such that the final digit has appeared before
- Difference between Ambiguous and Unambiguous Grammar
- Introduction to Queue Automata
- DFA that recognizes number of 0 is multiple of 3 on input {0,1}
- Polytime Manyone reduction: Clique to E-TM
- DFA that begins with 'a' but does not contain substring 'aab'

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.