Kernel: Python 3
automaton.prefix
An automaton that accepts all the prefixes of the words accepted by the previous automaton.
Algorithm:
Every coaccessible non-final state is made final, 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]: