unuguldi Languages CS313 Spring 2018 Problem 1. Show a DFSM to accept the following languages: 1. tw E fa, by* w does not have aab as a substring) 2. twE a, by* w has both aa and bb as a substring) 3. fw E fa, b)* w has length at least 3 and the third character is a) 4. {we {a, b}*: w does not end in ba) 5. (w E fa, b}' w has an even length and odd number of a's) oblem 2. Show an NDFSM to accept the following languages, using a pre- cified number of states: w E [0,1]*: w ends with 00 using three states fw (0,1]: w contains an even number nf 0 or rat 1