The Gateway to Computer Science Excellence

0 votes

We described the $"$product construction$"$ that took two DFA's and constructed one DFA whose language is intersection of the languages of the first two.

- Show how to perform the product construction on NFA's (without $\in$ transitions).
- Show how to perform the product construction on $\in-$NFA's
- Show how to modify the product construction so the resulting DFA accepts the difference of the languages of the two given DFA's.
- Show how to modify the product construction so the resulting DFA accepts the union of the languages of the two given DFA's.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,274 answers

198,148 comments

104,797 users