223 views
0 votes
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.

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

Please log in or register to answer this question.

Related questions