THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M<sub>k, 1</sub> AND THEIR COMPLEXITY (Q3580222): Difference between revisions
From MaRDI portal
Latest revision as of 02:35, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M<sub>k, 1</sub> AND THEIR COMPLEXITY |
scientific article |
Statements
THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M<sub>k, 1</sub> AND THEIR COMPLEXITY (English)
0 references
11 August 2010
0 references
Thompson-Higman monoids
0 references
Green relations
0 references
computational complexity
0 references
finite generating sets
0 references
decision problems
0 references
0 references
