Stephen¶
-
class Stephen : public libsemigroups::Runner¶
Defined in
stephen.hpp
.On this page we describe the functionality in
libsemigroups
relating to Stephen’s procedure for finitely presented semigroups. This class implements Stephen’s procedure for (possibly) constructing the word graph (ActionDigraph) corresponding to the left factors of a word in a finitely presented semigroup. The algorithm implemented in this class is closely related to the Todd-Coxeter algorithm (as implemented in congruence::ToddCoxeter) and originates in Applications of automata theory to presentations of monoids and inverse monoids by J. B. Stephen.
Member types¶
The return type of the function |
|
The type of the nodes of a |
Constructor¶
Default constructor. |
|
Construct from a presentation. |
|
Default move constructor. |
|
Default copy constructor. |
|
Default move assignment operator. |
|
Default copy assignment operator. |
Initialization¶
Initialize from a presentation. |
|
Set the word. |
|
Set the word. |
Defining data¶
The input presentation. |
|
The word. |
Results of the algorithm¶
The accept state of the word graph. |
|
The word graph. |
Member functions inherited from Runner¶
Check if the runner is dead. |
|
Check if |
|
Stop |
|
Check if it is time to report. |
|
Get the minimum elapsed time between reports. |
|
Set the minimum elapsed time between reports. |
|
Set the minimum elapsed time between reports. |
|
Report why |
|
Run until |
|
Run for a specified amount of time. |
|
Run for a specified amount of time. |
|
Run until a nullary predicate returns |
|
Run until a nullary predicate returns |
|
Check if currently running. |
|
Check if the runner is currently running for a particular length of time. |
|
Check if the runner is currently running until a nullary predicate returns |
|
Check if |
|
Check if the runner is stopped. |
|
Check if the runner was, or should, stop because of the argument for |
|
Check if the amount of time passed to |