Results of the algorithm¶
This page contains a description of the member functions of the
Stephen class that permit access to the data produced when the algorithm is successfully run.
The accept state of the word graph.
This function triggers the algorithm implemented in this class (if it hasn’t been triggered already), and then returns the accept state of the produced word graph.
The problem of determining whether two words are equal in a finitely presented semigroup is undecidable in general, and this function may never terminate.
inline digraph_type const &libsemigroups::Stephen::word_graph() const noexcept¶
The word graph.
Returns a const reference to the word graph in its present state. The algorithm implemented in this class is not triggered by calls to this function.
(None) – This function is
noexceptand is guaranteed never to throw.
A const reference to a digraph_type.