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.

Examples



In [1]:

    
import vcsn



In [2]:

    
%%automaton -s a
context = "lan_char, q"
$ -> 0 <2>
0 -> 1 <3>a
1 -> 1 <4>b
1 -> 2 <5>\e
2 -> 3 <6>c
3 -> 4 <7>d
3 -> 5 <8>e
4 -> $ <9>
6 -> 0 <10>A



In [3]:

    
a.suffix()









    Out[3]: