Could anyone tell me which part of Kleene's theorem we have to use for questions 3 and 4?
I was able to get an NFA with 3 states by trail and error using the techniques from Chapter 5, but I don't know if we have to use one of the parts of Kleene's theorem.
The same goes for question 4.
According to theorem 7 p.137 of Cohen there is a FA for every NFA that accepts the exact same language. That I get. In proof two of theorem 7 p.138 of Cohen there is something written on the fact that the algorithm for producing FA* form FA should be used, or so it looks.
Am I on the right track for these questions or am I barking up the wrong tree.