Kernel: Python 3
polynomial.trie
Generate a "trie" automaton (a prefix tree) from a finite series, given as a polynomial of words.
Postconditions:
Result.is_deterministic()
Result = p.trie.shortest(N)
for a large enough N.
Properties:
The support of result is isomorphic to the support of determinized standard automaton built from the polynomials seen as a rational expression, however weights are not placed at the same locations.
See also:
Examples
In [1]:
Boolean weights (finite language)
In [2]:
In [3]:
Weighted polynomials of words (finite series)
In [4]:
In [5]: