x Assignment x X = HW1 Google DOCS X TITANIUM VZ6Ue VEibGfLPPn0ooe-totN9xgMBOMETUPGE/edit Bar BODY School Vid music collect Free ALISON Coding camp runner COCOA de 56 minutes ago by Chary Vielma Homework 1: DFAs and NFAs Hardcopy due in class. You may work alone, or create a single submission for a team of 2-3 students. If you work in a team, turn in only one submission with everyone's name on it, You are expected to complete, or at least attempt, all of the following problems. Write a star on one problem; that problem will be the basis for your grade. Exercise 1 (3 points): Sketch a DFA for each of the following languages. In each case the alphabet is ={0,1). a) {w:011 is a substring of w} [1 point] b) {w:011 is a substring at the end of w} [1 point] c) {w: w contains at least two Os and at least one 1} [1 point] Show your work Exercise 2 (3 points): Sketch a NFA with the specified number of states for each of the following languages. In each case the alphabet is ={0,1). [1 point] a) {w: w ends in 01} with three states. b) {w: w contains the substring 0110) with five states. [1 point] c) {W: W contains an odd number of ones or exactly two Os} [1 point] Show your work Exercise 3 (3 points): 1 Given: NFA M = ({1,2,3), {a,b}8. (1). {1}) Construct: equivalent DFA M = (Q' 2.8.90'. F ALIENWARE