I'm having trouble with assignment 3, question 3. I've worked out the regular expression for the language, to make it easier to work out what the NFA must look like. But I just can't figure out a 4 state NFA to fit the regular expression (I presume when they say 4 state, it means 4 states including the first "-" state?).
If someone could maybe help me out with how to the start off the NFA (I'm not looking for the answer), it would be greatly appreciated.