Liking cljdoc? Tell your friends :D

kigen.chain-sgp

Chain semigroups based on a skeleton.

Chain semigroups based on a skeleton.
raw docstring

->chain-transfclj

(->chain-transf {hd :supsethd X :stateset} chains t)

A transformation encoding the action of a transformation on all maximal chains.

A transformation encoding the action of a transformation on all maximal
chains.
sourceraw docstring

chain-sgp-gensclj

(chain-sgp-gens gens)

Just a convenient function to map generators to chain semigroup generators.

Just a convenient function to map generators to chain semigroup generators.
sourceraw docstring

chain-transf->clj

(chain-transf-> {X :stateset} chains c-t)

Taking a lift (a transformation of the set of chains) it gives back the original transformation.

Taking a lift (a transformation of the set of chains) it gives back the
original transformation.
sourceraw docstring

check-morphismclj

(check-morphism gens)

Takes a generator set of transformations, produces a chain semigroup and checks the morphic relation by checking all products.

Takes a generator set of transformations, produces a chain semigroup and
checks the morphic relation by checking all products.
sourceraw docstring

fillingsclj

(fillings chains fullhd)

A map that contains filling for gaps in a reduced Hasse diagrams. Used for finding dominating chains.

A map that contains filling for gaps in a reduced Hasse diagrams. Used
for finding dominating chains.
sourceraw docstring

gap?clj

(gap? a b hd)

Returns true if there is a gap between a and b in Hasse diagram hd, i.e. a is only transitively related to b.

Returns true if there is a gap between a and b in Hasse diagram hd, i.e.
a is only transitively related to b.
sourceraw docstring

gapsclj

(gaps chains fullhd)

Returns all pairs in the reduced cover relation that are not related in the full relation. Chains have to be given since BECKS produces examples where [0 1 3 3] where filling the gaps in the reduced hd is not enough!

Returns all pairs in the reduced cover relation that are not related in
the full relation. Chains have to be given since BECKS produces examples
where [0 1 3 3] where filling the gaps in the reduced hd is not enough!
sourceraw docstring

max-chainsclj

(max-chains X hd)

All maximal chains in an inclusion Hasse diagram hd with top set X.

All maximal chains in an inclusion Hasse diagram hd with top set X.
sourceraw docstring

on-hdclj

(on-hd hd X transf)

The result of acting by a transformation on superset Hasse diagram in a skeleton. The full state set and the singletons are put back.

The result of acting by a transformation on superset Hasse diagram in a
skeleton. The full state set and the singletons are put back.
sourceraw docstring

on-max-chainclj

(on-max-chain c t fllngs)

Acting on maximal chain. Finding a dominating chain by using a fillings table.

Acting on  maximal chain. Finding a dominating chain by using a fillings
table.
sourceraw docstring

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

× close