Trait rustfst::semirings::CompleteSemiring
source · pub trait CompleteSemiring: Semiring { }
Expand description
A semiring (S, ⊕, ⊗, 0, 1)
is said to be complete if for any index set I
and any family
(ai)i ∈ I
of elements of S
, ⊕(ai)i∈I
is an element of S
whose definition
does not depend on the order of the terms in the ⊕-sum.
Note that in a complete semiring all weighted transducers are regulated since all
infinite sums are elements of S.
For more information : https://cs.nyu.edu/~mohri/pub/hwa.pdf