Some decidability and undecidability results on Green's relations for automatic monoids. (Q2464344)

In this very interesting paper, the author proves some decidability and undecidability results on the Green's relations for finitely presented automatic monoids. Nine fundamental types of automaticity are investigated for each of the five Green's relations \(\mathcal R\), \(\mathcal L\), \(\mathcal D\), \(\mathcal J\) and \(\mathcal H\). A few of the forty-five cases remain open for \(\mathcal D\) as well as for \(\mathcal H\).