Some decidability and undecidability results on Green's relations for automatic monoids. (Q2464344): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some decidability and undecidability results on Green's relations for automatic monoids. |
scientific article |
Statements
Some decidability and undecidability results on Green's relations for automatic monoids. (English)
0 references
19 December 2007
0 references
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\).
0 references
Green relations
0 references
automatic monoids
0 references
decidability
0 references
undecidability
0 references
automatic structures
0 references
finitely generated monoids
0 references
regular languages
0 references
decision algorithms
0 references
