The number of states required by a Finite State Machine, to simulate the behavior of a computer with a memory capable of storing 'm' words, with each being 'n' bits long is
- A. $m \times 2^n$
- B. $2^{m+n}$
- C. $2^{mn}$
- D. $m+n$
Answer: C. $2^{mn}$
Explanation: Total number of bits in the memory is $m \times n$. Since each bit can be 0 or 1, the total number of unique states the memory can be in is $2^{mn}$.