Step 1: NAND gate logic.
A NAND gate is a NOT AND gate, meaning it outputs the opposite of an AND gate. The boolean expression for an AND gate is:
\[
A . B = Y
\]
The NOT operation is then applied to this output. Thus, the Boolean expression for the NAND gate is:
\[
\overline{A . B} = Y
\]
Step 2: Conclusion.
Hence, the correct Boolean expression for a NAND gate is \( \overline{A . B} \), which simplifies to \( A . B = Y \).
\[
\boxed{A . B = Y}
\]