step_hen contains a rudimentary implementation of two algorithms of J. B. Stephen Stephen1987aa and Stephen1990aa and one of Andrew Cutting Cutting2001aa 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.
step_hen was written by James D. Mitchell and Maria Tsalakou. The development repo is on GitHub.
The implementation is rudimentary because it lacks many obvious optimisations and improvements, it is intended as a simple proof of concept.
changelog
presentation wordgraph schutzenbergergraph stephen biblio
genindexmodindexsearch