Descriptive-complexity conjecture for nondeterministic dynamically generated basic sequences

Let $Q=(q_n)_{n\geq 1}$ be a nondeterministic dynamically generated basic sequence. Let $\mathcal{N}(Q)$, $\mathcal{DN}(Q)$, and $\mathcal{UN}(Q)$ denote the corresponding normality classes, and let $D_2(\boldsymbol{\Pi}_3^0)$ denote the stated difference-hierarchy completeness class. Descriptive-complexity conjecture. The following sets each have Hausdorff dimension $1$ and are $D_2(\boldsymbol{\Pi}_3^0)$-complete:

1. $(\mathcal{N}(Q)\cap\mathcal{DN}(Q))\setminus\mathcal{UN}(Q)$;
2. $\mathcal{DN}(Q)\setminus\mathcal{N}(Q)$;
3. $\mathcal{N}(Q)\setminus\mathcal{DN}(Q)$.

This is proposed as a strong converse direction to the deterministic normality-equivalence conjecture, predicting both maximal Hausdorff dimension and precise descriptive complexity.