Black box algorithms to compute Green's relations. Basic implementations, not efficient ones. Suitable for small semigroups, written for processing the enumerated transformation semigroups.
Black box algorithms to compute Green's relations. Basic implementations, not efficient ones. Suitable for small semigroups, written for processing the enumerated transformation semigroups.
(D-classes S mul)Computes the D-classes of a finite semigroup. Classes are in no particular order.
Computes the D-classes of a finite semigroup. Classes are in no particular order.
(L-classes S mul)Computes the D-classes of a finite semigroup. Classes are in no particular order.
Computes the D-classes of a finite semigroup. Classes are in no particular order.
(principal-ideal a S mul)Computes the principal ideal of S1aS1 of a in S with multiplication mul.
Computes the principal ideal of S1aS1 of a in S with multiplication mul.
(principal-left-ideal a S mul)Computes the principal left ideal S1a of a in semigroup S with multiplication mul.
Computes the principal left ideal S1a of a in semigroup S with multiplication mul.
(principal-right-ideal a S mul)Computes the principal right ideal aS1 of a in semigroup S with multiplication mul.
Computes the principal right ideal aS1 of a in semigroup S with multiplication mul.
(R-classes S mul)Computes the R-classes of a finite semigroup. Classes are in no particular order.
Computes the R-classes of a finite semigroup. Classes are in no particular order.
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |