Implementation of morphisms into finite monoids.
ufind * iden_green_subsemi(subsemi *, green_relation)
Computes the least congruence which identifies all elements equivalent for a given Green relation ins...
Definition monoid_congruences.c:304
ufind * iden_bpolamt_mono(morphism *)
Returns the least congruence satisfying the BPol(AMT) equation.
Definition monoid_congruences.c:377
ufind * iden_knast_mono(orbits *)
Returns the least congruence satisfying the BPol(DD) equation (Knast).
Definition monoid_congruences.c:467
void hdet_lrpol_level(morphism *, ufind *, FILE *, short *, short *)
Computes the levels of a syntactic morphism in the LPol(C) and the RPol(C)-hierarchies: RPol(C),...
Definition monoid_congruences.c:877
void compute_leastcong(morphism *, ufind *)
Computation of the least congruence that contains a given partition.
Definition monoid_congruences.c:244
ufind * iden_bpolgrp_mono(orbits *)
Returns the least congruence satisfying the BPol(GR⁺) equation.
Definition monoid_congruences.c:700
ufind * iden_qknast_mono(orbits *, subsemi *)
Returns the least congruence satisfying the BPol(MOD⁺) equation (Knast on the MOD-Kernel).
Definition monoid_congruences.c:552
ufind * iden_bpolamtp_mono(orbits *)
Returns the least congruence satisfying the BPol(AMT⁺) equation.
Definition monoid_congruences.c:639
ufind * iden_green_mono(morphism *, green_relation)
Computes the least congruence containing one of the four Green relations.
Definition monoid_congruences.c:251
ufind * iden_lpolc_mono(morphism *, parti *)
Returns the equivalence obtained by identifying the elements which should be equal according to the L...
Definition monoid_congruences.c:822
ufind * iden_bpolmod_mono(morphism *)
Returns the least congruence satisfying the BPol(MOD) equation.
Definition monoid_congruences.c:324
ufind * iden_green_orbmono(orbits *, green_relation)
Computes the least congruence which identifies all elements equivalent for a given Green relation ins...
Definition monoid_congruences.c:311
ufind * iden_rpolc_mono(morphism *, parti *)
Returns the equivalence obtained by identifying the elements which should be equal according to the R...
Definition monoid_congruences.c:847
ufind * iden_blockg_mono(morphism *)
Returns the least congruence satisfying the BPol(GR) equation (Block group).
Definition monoid_congruences.c:424
ufind * iden_mpolc_mono(morphism *, parti *)
Returns the equivalence obtained by identifying the elements which should be equal according to the M...
Definition monoid_congruences.c:769
Computations of ideals in monoids.
Tests of properties on morphisms.
green_relation
The four Green relations.
Definition monoid_props.h:30
Separation by group languages.
The type used to represent a morphism into a finite monoid.
Definition monoid.h:91
Type used to represent C-orbits of a morphism.
Definition monoid_orbits.h:31
First type used to represent a partition. This is not the one used by Union-Find.
Definition type_partitions.h:36
Type used to represent a subsemigroup and its Green relations.
Definition monoid_sub.h:35
Second type used to represent a partition. This is the type used by Union-Find.
Definition type_partitions.h:138
Implementation of doubly linked lists.