@@ -191,7 +191,7 @@ It consists in following the arguments through sequences of recursive calls and
$\bullet$ otherwise $a_{i,j}=\infty$ (in particular if $i>p$ or $j>q$).&\\
\end{tabular}
$\mcal{R}$ is size-change terminating (SCT) if, in the transitive closure of $\mcal{G}(\mcal{R})$ (using the min-plus semi-ring to multiply the matrices labeling the edges),
$\mcal{R}$ is size-change terminating for $\rhd$ if, in the transitive closure of $\mcal{G}(\mcal{R},\rhd)$ (using the min-plus semi-ring to multiply the matrices labeling the edges),
all idempotent matrices labeling a loop have some $-1$ on their diagonal.