- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

According to the theorem, If L and M are two regular languages, then L ∩ M is also regular language.

Construct A∩B where A and B is given as follows −

The language A ={10,100,00,001,1010,…..}

The language B ={01,1010,10,101,…..}

AA = (QA, Σ, δA, qa, FA) AB = (QB, Σ, δB, qB, FB) A∩B=(QA x QB ,Σ,δ(qA x qB ,FA x F B )

Where,

δ(( p, q), a) =δL (p, a), δM (q, a))

Here, QA x QB = {p,q} x {r,s} ={(p, r), (p, s), (q, r), (q, s)} Z = {0, 1} qA x qB = {p, r} FA x FB = {q, s}

The finite automaton is given below −

- Related Questions & Answers
- Explain the concatenation process in DFA
- Explain the complementation process in DFA
- Explain Union process in DFA
- Construct DFA of alternate 0’s and 1’s
- Explain the cross product method process in DFA
- Explain Arden’s theorem to convert DFA to Regular Expression
- Design a DFA of a string with at least two 0’s and at least two 1’s
- Design a DFA machine accepting odd numbers of 0’s or even numbers of 1’s
- Two’s Complement
- The WhatsApp’s Two-step Verification
- Design DFA for language over {0,1} accepting strings with odd number of 1’s and even number of 0’s
- Explain Arden’s Theorem in TOC.
- Intersection of two arrays JavaScript
- Python - Intersection of two String
- Explain the process of mergers & acquisition

Advertisements