Will the state removal and subset construction be on the exam?
I’m guessing that we won’t be asked directly to do this kind of questions.
But, such skills are important when you’re trying to prove a language is regular and couldn’t come up with a DFA but managed to come up with a NFA or Regex.
Yes, we will need to know how to do these. There will almost certainly be a question requiring a subset construction.