Kernel: Python 3
automaton.suffix
An automaton that accepts all the suffixes of the words accepted by the previous automaton.
Algorithm:
The accessible non-initial states are made initial (with weight one).
Preconditions:
None
Caveat:
While semantically sound for Boolean automata, hardly makes sense on weighted automata.
See also:
Examples
In [1]:
In [2]:
In [3]: