  We study systems of $n \geq 1$ discrete differential equations of order
$k\geq1$ in one catalytic variable and provide a constructive and elementary
proof of algebraicity of their solutions. This yields effective bounds and a
systematic method for computing the minimal polynomials. Our approach is a
generalization of the pioneering work by Bousquet-M\'elou and Jehanne (2006).
