Final answer:
The minimal NFA for the language L = anbm has two states transitioning on reading 'a' or 'b'. A regular expression for this language is (a(bb)*a)*b(aa)*|(b(aa)*b)*a(bb)*, which ensures an odd total count of symbols.
Step-by-step explanation:
To construct a minimal NFA (Nondeterministic Finite Automaton) that accepts the language L = n + m is odd, we can consider that the sum of n and m being odd means that one must be even and the other odd, as two even or two odd numbers cannot add up to an odd number.
The minimal NFA will have two states, one initial state q0 which is also an accept state, and one other state q1. The automaton will transition from q0 to q1 and vice versa on reading a or b, starting in an accept state ensures that the string with a single symbol is accepted.
Here's the regular expression for L(N) = L: (a(bb)*a)*b(aa)*|(b(aa)*b)*a(bb)*. This expression represents strings with an even number of a's followed by one b, or an even number of b's followed by one a, ensuring the total count of symbols is odd.