A class of low linear orders having computable presentations

It is shown that any low linear order of the form $\mathcal{L}+\omega^*$, where $\mathcal{L}$ is some $\eta$-presentation, has a computable copy. This result contrasts with there being low $\eta$-presentations not having a computable copy.