The formal definition of a s-NFA specifies the following: 1. Alphabet 2. the set of states Q 3. the start state SEQ 4. the accepting states ACQ 5. the transition table 8: a function from Q x W{c) to power(Q). 6. reject state: this is usually unspecified, but understood to be included; similar to a return statement at the end of a function. For every problem in this assignment, 1. = {a,b) Q = {S0, S1, S2, S3, S4, S5, S6, S7, S8, S9) 2. Start state So If I am giving the NFA, I will give the accepting states A, and the transition table. If you are asked to give the DFA, you need to give A and the transition table. For this assignment, give this as a table instead of a diagram. I will give an example in Q1. NOTE: it is important that you draw and work with diagrams - just translate them when you submit. diagrams give you an insight into the machine that tables do not. 1. (10 points) Let M be the NFA with alphabet, set of states and start state as given above. The transition table of Mis: {S1, S2} {S} B S. Si {S3} S2 {$4} S: S4 Ss So S Sg S, {Si, SS} {S2, Ss} Accepting states A = {S} For each of the following strings, state whether or not the string would be accepted (b) 'aba' (c) 'aabbb (d) 'abaaba' (e) aabb