Green's Relation for Semigroup with many D-classes
(Artificial Example)

  1. Generators
    a : [1, 0, 2, 3, 4]
    b : [0, 1, 3, 2, 4]
    c : [0, 0, 1, 2, 3]

  2. Elements
    Elements : 48
    IRepresentationMap
    a[1, 0, 2, 3, 4]
    b[0, 1, 3, 2, 4]
    c[0, 0, 1, 2, 3]
    *a.a[0, 1, 2, 3, 4]
    b.a[1, 0, 3, 2, 4]
    c.a[1, 1, 0, 2, 3]
    c.b[0, 0, 1, 3, 2]
    b.c[0, 0, 2, 1, 3]
    c.c[0, 0, 0, 1, 2]
    c.b.a[1, 1, 0, 3, 2]
    b.c.a[1, 1, 2, 0, 3]
    c.c.a[1, 1, 1, 0, 2]
    b.c.b[0, 0, 3, 1, 2]
    c.c.b[0, 0, 0, 1, 3]
    c.b.c[0, 0, 0, 2, 1]
    b.c.c[0, 0, 1, 0, 2]
    c.c.c[0, 0, 0, 0, 1]
    b.c.b.a[1, 1, 3, 0, 2]
    c.c.b.a[1, 1, 1, 0, 3]
    c.b.c.a[1, 1, 1, 2, 0]
    b.c.c.a[1, 1, 0, 1, 2]
    c.c.c.a[1, 1, 1, 1, 0]
    c.b.c.b[0, 0, 0, 3, 1]
    b.c.c.b[0, 0, 1, 0, 3]
    b.c.b.c[0, 0, 2, 0, 1]
    c.c.b.c[0, 0, 0, 0, 2]
    c.b.c.c[0, 0, 0, 1, 0]
    *c.c.c.c[0, 0, 0, 0, 0]
    c.b.c.b.a[1, 1, 1, 3, 0]
    b.c.c.b.a[1, 1, 0, 1, 3]
    b.c.b.c.a[1, 1, 2, 1, 0]
    c.c.b.c.a[1, 1, 1, 1, 2]
    c.b.c.c.a[1, 1, 1, 0, 1]
    *c.c.c.c.a[1, 1, 1, 1, 1]
    b.c.b.c.b[0, 0, 3, 0, 1]
    c.c.b.c.b[0, 0, 0, 0, 3]
    c.b.c.b.c[0, 0, 0, 2, 0]
    b.c.b.c.c[0, 0, 1, 0, 0]
    b.c.b.c.b.a[1, 1, 3, 1, 0]
    c.c.b.c.b.a[1, 1, 1, 1, 3]
    c.b.c.b.c.a[1, 1, 1, 2, 1]
    b.c.b.c.c.a[1, 1, 0, 1, 1]
    *c.b.c.b.c.b[0, 0, 0, 3, 0]
    *b.c.b.c.b.c[0, 0, 2, 0, 0]
    *c.b.c.b.c.b.a[1, 1, 1, 3, 1]
    *b.c.b.c.b.c.a[1, 1, 2, 1, 1]
    b.c.b.c.b.c.b[0, 0, 3, 0, 0]
    b.c.b.c.b.c.b.a[1, 1, 3, 1, 1]

  3. D Classes
    D classes : 9, L classes : 27, R classes : 14

  4. Hierarchy of L & R classes