In NFA on receiving a input, a state can transit to how many number of subsets of states Q.Select one:a. Q(Q+1)/2b. Q^2c. Qd. 2^Q

Break Down the Problem

1. This is a conceptual question regarding the behavior of a Non-deterministic Finite Automaton (NFA).
2. We need to consider the possible transitions of a state to subsets of states given a certain input.

Relevant Concepts

1. In an NFA, when a state receives an input, it can transition to any combination of states in the set of states $Q$.

Analysis and Detail

1. Each state can either transition to a state or not transition at all, which means for each state in $Q$ there are two possibilities (to include or exclude that state).
2. Since we have $Q$ states, the total number of subsets of these states is given by the formula for the power set, which is $2^Q$.

Verify and Summarize

1. The reasoning confirms that every combination of subsets of states can represent a transition from a given state.
2. Hence, the number of subsets of states $Q$ is accurately represented by $2^Q$.

Final Answer

The correct answer is d. $2^Q$.