Liking cljdoc? Tell your friends :D
Clojure only.

kigen.greens

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.
raw docstring

D-classesclj

(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.
sourceraw docstring

L-classesclj

(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.
sourceraw docstring

principal-idealclj

(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.
sourceraw docstring

principal-left-idealclj

(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.
sourceraw docstring

principal-right-idealclj

(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.
sourceraw docstring

R-classesclj

(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.
sourceraw docstring

cljdoc is a website building & hosting documentation for Clojure/Script libraries

Keyboard shortcutsReport a problemcljdoc on GitHub
× close