3: Language of a DFA (a) List 2 strings the DFA accepts (b) List 2 strings the DFA rejects (c) What is the language of this DFA (the set of accepted strings)? 4: Design DFAS Design a DFA for each of the following languages. The alphabet is {x,y} .L = {w w has substring ryyr} L2 = {w w doest not have substring xywr} (Hint: Do not start this DFA from scratch, how can you modify the previous DFA). Ls = {ww has exactly 2 ys} LA = {w w has at least 2 y/s} 3: Language of a DFA (a) List 2 strings the DFA accepts (b) List 2 strings the DFA rejects (c) What is the language of this DFA (the set of accepted strings)? 4: Design DFAS Design a DFA for each of the following languages. The alphabet is {x,y} .L = {w w has substring ryyr} L2 = {w w doest not have substring xywr} (Hint: Do not start this DFA from scratch, how can you modify the previous DFA). Ls = {ww has exactly 2 ys} LA = {w w has at least 2 y/s}