** Next:** Acknowledgements
** Up:** Future Work
** Previous:** Minimization

##

Subsequentiality and Bi-machines

Recall that the transducer determinization algorithm is guaranteed to
terminate only in case the input transducer can be
determinized, i.e., the transducer describes a subsequential
transduction. Therefore, it is important to implement an algorithm
which checks for this property. We are working on an algorithm to
check subsequentiality of a given pfst, based on the algorithm
presented in [32]. We have adapted the algorithm
proposed in [32] since it fails to treat certain types
of transducer correctly; we intend to provide details somewhere else.
A further natural extension is the generalization of bi-machines and
the related algorithms to the case of predicates.

*Noord G.J.M. van*

*2001-06-22*