Introduction:
When an NFA with n states is converted to a DFA, the maximum number of states for the DFA is 2^n. However, since the question specifies that the initial state is excluded, we must subtract 1 from n before calculating the maximum number of states for the DFA.

Explanation:
To convert an NFA to a DFA, we need to follow these steps:
1. Create a DFA with a set of states that correspond to the subsets of states of the NFA.
2. For each state in the DFA, find the set of states in the NFA that it corresponds to.
3. For each input symbol, find the set of states in the NFA that can be reached from the set of states corresponding to the current state in the DFA.
4. Repeat steps 2 and 3 until all states in the DFA have been processed.

Maximum number of states for the DFA:
Since the initial state is excluded, the NFA has n-1 states. Therefore, the maximum number of possible states for the DFA is:
2^(n-1)

Example:
If the NFA has 6 states excluding the initial state, then the maximum number of possible states for the DFA is:
2^(6-1) = 2^5 = 32

Conclusion:
In summary, when an NFA of n states excluding the initial state is converted to a DFA, the maximum number of possible states for the DFA is 2^(n-1). This is because we need to create a DFA with a set of states that correspond to the subsets of states of the NFA.

2^6