I am trying to understand how many states should be there in a Finite Automata which does not accept anything. I thought it to be containing only one non-final state, the starting state, with all transitions going to itself. But one of my teachers mentioned that the set of final states cannot be empty. Does that mean there will be two states states, one start state and one final state, with no transition between the two?
Automata for empty language
automata;finite automata