The factor-complexity and critical-exponent conjecture for reversed morphic images of G

Let ${\mathbf G}=\gamma^\omega(0)$, where $\gamma=[01,2,02]$, let $h$ be a morphism in Table~, and let $h^R$ denote the reversed morphism used in that table. Let $\mu$ be the critical exponent of ${\mathbf G}$. Reversed-morphic-image conjecture. For each such morphism $h$, the word $h^R({\mathbf G})$ has factor complexity $2n+1$ and critical exponent $\mu$. This is stated as an open problem in the source, and asks whether the same complexity and exponent persist for the listed reversed morphic images.