step_hen - Version 0.0.3¶
step_hen contains a rudimentary implementation of two algorithms of J. B.
Stephen [Ste87] and [Ste90] and one of Andrew
Cutting [Cut01] for finitely presented monoids and inverse
monoids in python3. These algorithms can be used to check equality of a
fixed word with any other word in a finitely presented monoid, or inverse
monoid, and to compute the structure of a finitely presented inverse monoid.
The implementation is rudimentary because it lacks many obvious optimisations and improvements, it is intended as a simple proof of concept.