So every NFA can be transformed to a DFA and every DFA can be transformed to a minimal DFA.But every NFA can also be transformed to a GNFA (generalized NFA) with 2 states. This is just the start and end-state with the RE of the $ L_{NFA} $ written on the bow between. So I think  the GNFA can be smaller (less states) because you can make choices. For instance a bow from state 1 to state 2 could contain: $ ab | a $ which in a DFA would require more states. So my question is basically: Am I right about this? Can you there exist a smaller NFA to a minimal DFA?
Can there exist a smaller NFA then a minimal DFA
automata;finite automata;nondeterminism