Complete the following exercise. Part (c) is somewhat ambiguous if the string has length less than ten. Please complete Part (c) twice: first, where every string of length less than ten is rejected; second, where a string of length less than ten is accepted iff it contains a 1. [Hint: There is a 20-state solution to the first (with no -moves) and an 11-state solution to the second.]

Exercise 2.5.2: Repcat Exercise 2.5.1 for the following e-NFA 7 $7 Exercise 2.5.3: Design eNFA's for the following languages. Try to use e transitions to simplify your design a) The set of strings consisting of zero or more a's followod by zero or more b's, followed by zero or more es. 010 repcated one or more times positions is ! b) The set of strings that consist of either 01 repeated one or more times or ! c) The set of strings of O's and 1's such that at least one of the last ten