AES-GCM falls category A5 in the paper. In AES-GCM doesn't support $\texttt{no-AAD}$, even you don't use AAD during encryption, AES-GCM convert his as a $\texttt{zero-length-AAD}$.
See in the NIST Special Publication 800-38d, page 15;
Algorithm 4: $GCM-AE_K (IV, P, A)$
…
4. Let $u = 128\cdot\lceil\operatorname{len}(C)/128\rceil - \operatorname{len}(C)$ and let $v = 128\cdot\lceil\operatorname{len}(A)/128\rceil - \operatorname{len}(A)$.
5. Define a block, $S$, as follows: $$S = \operatorname{GHASH}_H(\mathbf{A \mathbin\| \mathtt 0^v} \mathbin\| C \mathbin\| \mathtt 0^u \mathbin\| \mathbf{[\operatorname{len}(A)]_{64}} \mathbin\| [\operatorname{len}(C)]_{64}).$$
…
In Steps 4 and 5, the AAD and the ciphertext are each appended with the minimum number of ‘$\mathtt 0$’ bits, possibly none, so that the bit lengths of the resulting strings are multiples of the block size (The bolds, are mine).
$A$ is associated data, $len(A) = 0$ therefore, $\mathtt{v} = 0$. Even in this case, we have $[\operatorname{len}(A)]_{64}$, this 64-bit encoding of the length of th associated data and this will always indicate the exsitance of AAD, zero-length or not!.
If an attacker, removes the associated data, to make it seem like zero-length, during the decryption, one must halt with the tag mismatch ( Always halt and stop the decryption at once).
A scheme that supports no-AAD, must not carry information about the missing AAD, otherwise, it falls into zero-length AAD.
In the end, we have extra protection against forgeries with zero-length AAD.