View the step-by-step solution to:


This question was created from HW2_Indiv_CSE105_Wi18.pdf


1. (10 points) Consider the DFAs Mi (on the left) and M2 (on the right):
(a) If we use the general constructions discussed in class and in the book for building a DFA whose language
L(M, ) UL(M2)
how many states would be in this DFA? Briefly justify your calculation.
(b) Draw the state diagram that results from this construction and remove any unreachable states. How
many states are left?
(c) Describe the language L(Mi) UL(M2) in set builder notation. You may find it useful to first describe
L(Mi) and L(M2) in set builder notation first.
(d) Use the description from (c) to draw a DFA with fewer states even than what you saw in part (b).
Draw the state diagram in JFLAP and include the image in your submission.
Note: For parts (b) and (d), you can use the "test equivalence" feature of JFLAP to check your work.

Recently Asked Questions

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question
Let our 24/7 Computer Science tutors help you get unstuck! Ask your first question.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes
A+ icon
Ask Expert Tutors