Another semigroup of complexity n-1.
Application de l'étude de certaines congruences à un problème de décidabilité
Arithmetical properties of finite rings and algebras, and analytic number theory. II.
Artin-Gruppen und Coxeter-Gruppen.
Automata accepting primitive words.
Automates et commutations partielles
Bands of Groups with Universal Properties.
Bicharacters of semigroups.
Binary words avoided by the Thue-Morse sequence.
Bisections reconnaissables
Braids: generalizations, presentations and algorithmic properties.
Catalan monoids, monoids of local endomorphisms, and their presentations.
Certain Rees matrix semigroups with universal properties.
Characterizations of right dense languages.
Codes limites et factorisations finies du monoïde libre
Coding in the existential theory of concatenation.
Combinatorial properties of products of graphs
Comments on the permutation property for semigroups.
Commutative cancellative semigroups with two generators
Commutative monoids with zero-divisors
We describe algorithms for computing the nilradical and the zero-divisors of a finitely generated commutative -monoid. These algorithms will be used for deciding if a given ideal of a finitely generated commutative -monoid is prime, radical or primary.