37extern char green_rel_array[4];
Implementation of morphisms into finite monoids.
bool is_da_subsemi(subsemi *, uint *)
Tests is a subsemigroup is in DA.
Definition monoid_props.c:506
bool is_group_semigroup(morphism *, uint *)
Tests if a semigroup (image of A⁺) is a group.
Definition monoid_props.c:89
bool is_letterind_mono(morphism *, uint *)
Tests if a morphism maps all letters to the same element.
Definition monoid_props.c:142
bool is_jsat_orbmono(orbits *, uint *)
Tests if all orbits satisfy the equation 1 ≤ s.
Definition monoid_props.c:617
bool is_trivial_semigroup(morphism *, uint *)
Tests if a semigroup (image of A⁺) is trivial.
Definition monoid_props.c:25
bool is_idem_subsemi(subsemi *, uint *)
Tests if a subsemigroup is idempotent.
Definition monoid_props.c:316
bool is_upbp_mono(orbits *, uint *)
Tests if a morphism satisfies the UPol(BPol(C)) equation for a given class C. The C-orbits are taken ...
Definition monoid_props.c:1307
bool is_comm_subsemi(subsemi *, uint *)
Tests is a subsemigroup is commutative.
Definition monoid_props.c:183
bool is_gtrivial_mono(morphism *, green_relation, uint *)
Tests if a monoid is P-trivial where P is one of the four Green relations (H,R,L,J).
Definition monoid_props.c:372
bool is_group_mono(morphism *, uint *)
Tests if a monoid is a group.
Definition monoid_props.c:75
bool is_knast_ker(orbits *, subsemi *, uint *)
Tests if the G-kernel satisfies Knast's equation for a group vari G.
Definition monoid_props.c:942
bool is_knast_at_mono(morphism *M, uint *cexa)
Tests if a morphism satisfies the AT-variant of Knast's equation.
Definition monoid_props.c:1192
bool is_htrivial_generators(morphism *, uint *)
Tests if the H-classes of 1 and all generators are trivial.
Definition monoid_props.c:444
bool is_trivial_orbmono(orbits *, uint *)
Tests if all orbits are trivial.
Definition monoid_props.c:56
bool is_comm_ltt_mono(orbits *, uint *)
Tests if a morphism satisfies the specific commutativity equation of the class LTT.
Definition monoid_props.c:215
bool is_bpolgrp_mono(orbits *, uint *)
Tests if a morphism satisfies the BPol(GR⁺) equation.
Definition monoid_props.c:1104
bool is_jsat_mono(morphism *, uint *)
Tests if a morphism satisfies the equation 1 ≤ s.
Definition monoid_props.c:544
bool is_idem_mono(morphism *, uint *)
Tests if a monoid is idempotent.
Definition monoid_props.c:299
bool is_group_orbmono(orbits *, uint *)
Tests if all orbits are groups.
Definition monoid_props.c:129
bool is_bpolmod_mono(morphism *, uint *)
Tests if a morphism satisfies the BPol(MOD) equation.
Definition monoid_props.c:730
bool is_ejsat_mono(morphism *, uint *)
Tests if a morphism satisfies the equation 1 ≤ e (for every idempotent e).
Definition monoid_props.c:563
bool is_knast_mono(orbits *, uint *)
Tests if a morphism satisfies Knast's equation.
Definition monoid_props.c:859
bool is_gtrivial_orbmono(orbits *, green_relation, uint *)
Tests if all orbits are P-trivial where P is one of the four Green relations (H,R,...
Definition monoid_props.c:431
green_relation
The four Green relations.
Definition monoid_props.h:30
bool is_com_orbmono(orbits *, uint *)
Tests if all orbits are commutative.
Definition monoid_props.c:203
bool is_da_mono(morphism *, uint *)
Tests if a monoid is in DA.
Definition monoid_props.c:478
bool is_trivial_subsemi(subsemi *, uint *)
Tests if a subsemigroup is trivial.
Definition monoid_props.c:45
bool is_gtrivial_subsemi(subsemi *, green_relation, uint *)
Tests if a subsemigroup is P-trivial where P is one of the four Green relations (H,...
Definition monoid_props.c:403
bool is_jsat_subsemi(subsemi *, uint, uint *)
Tests if a subsemigroup satisfies the equation 1 ≤ s.
Definition monoid_props.c:589
bool is_bpolamtp_mono(orbits *, uint *)
Tests if a morphism satisfies the BPol(AMT⁺) equation.
Definition monoid_props.c:1024
bool is_idem_orbmono(orbits *, uint *)
Tests if all orbits are simultaneously commutative and idempotent.
Definition monoid_props.c:332
bool is_blockg_mono(morphism *, uint *)
Tests if a monoid is a block group.
Definition monoid_props.c:640
bool is_group_subsemi(subsemi *, uint *)
Tests if a subsemigroup is a group.
Definition monoid_props.c:111
bool is_da_orbmono(orbits *, uint *)
Tests if all orbits are in DA.
Definition monoid_props.c:527
bool is_comm_mono(morphism *, uint *)
Tests is a monoid is commutative.
Definition monoid_props.c:162
bool is_bpolamt_mono(morphism *, uint *)
Tests if a morphism satisfies the BPol(AMT) equation.
Definition monoid_props.c:798
bool is_trivial_monoid(morphism *, uint *)
Tests if a monoid is trivial.
Definition monoid_props.c:14
Separation by group languages.
Type used to represent the Green relations of a finite monoid.
Definition monoid.h:69
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