  In this work we recall Pansiot's result on the complexity of pure morphic
sequences and we use the tools developed by Devyatov for morphic sequences to
prove the decidability of the complexity class of pure morphic sequences.
