Matrix semigroups?generators and relations.
Properties of the subsemigroups of the bicyclic monoid
In this paper we study some properties of the subsemigroups of the bicyclic monoid B, by using a recent description of its subsemigroups. We start by giving necessary and sufficient conditions for a subsemigroup to be finitely generated. Then we show that all finitely generated subsemigroups are automatic and finitely presented. Finally we prove that a subsemigroup of B is residually finite if and only if it does not contain a copy of B.
Reidemeister- Schreier type rewriting for semigroups.
Pattern avoidance classes and subpermutations.
Growth rates for subclasses of Av(321).
Page 1