diagram problem*]{} for a decidable presentation is a search problem that, given a word $W$ over ${\mathcal{A}}^{\pm 0}$ with $W \overset {\mathcal{G}}= 0$, asks to algorithmically construct a disk diagram ${\Delta}$ over such that ${\varphi}({\partial}{\Delta}) \equiv W$ and $