Nil-orders of commutative nil-bounded semigroups.
Nilpotency in semigroups and sublattices of their Booleans
Nilsemigroups on trees.
No semigroup is a finite union of mutants.
Noble inverse semigroups with bisimple core.
Non-isomorphic semigroups with isomorphic semigroups of subsets.
Non-looping string rewriting
Non-Looping String Rewriting
String rewriting reductions of the form , called loops, are the most frequent cause of infinite reductions (non- termination). Regarded as a model of computation, infinite reductions are unwanted whence their static detection is important. There are string rewriting systems which admit infinite reductions although they admit no loops. Their non-termination is particularly difficult to uncover. We present a few necessary conditions for the existence of loops, and thus establish a means...
Non-modular congruence lattices of Rees matrix semigroups
Nonsingular semilattices and semigroups
Normal cryptogroups with an associate subgroup
Let be a semigroup. For such that , we say that is an associate of . A subgroup of which contains exactly one associate of each element of is called an associate subgroup of . It induces a unary operation in an obvious way, and we speak of a unary semigroup satisfying three simple axioms. A normal cryptogroup is a completely regular semigroup whose -relation is a congruence and is a normal band. Using the representation of as a strong semilattice of Rees matrix semigroups,...
Not all fundamental 0-bisimple inverse semigroups contain charts.
Note of the greatest'semilattice decomposition of a semigroup.
Note on a certain class of orthodox semigroups.
Note on exclusive semigroups.
Note on nilpotency in semigroups
Note on quasi-Hamiltonian semigroups
Note on quasi-inverse semigroups.
Note on self-injective non-singular semigroups.
Note on semilattice congruences.