Trees associated to inverse monoid presentations

A necessary and sufficient condition for a tree to be a Schützenberger graph of a finite inverse monoid presentation is established. This condition is shown to be decidable for an arbitrary rational tree (being rational is a known necessary condition). It is also proved that it is decidable whether or not an arbitrary rational tree is a Schützenberger graph of some inverse monoid presentation.