Abstract
The join of two n-ary string relations is a main operation regarding to applications. n-Ary rational string relations are realized by weighted finite-state machines with n tapes. We provide an algorithm that computes the join of two machines via a more simple operation, the auto-intersection. The two operations generally do not preserve rationality. A delay-based algorithm is described for the case of a single tape pair, as well as the class of auto-intersections that it handles. It is generalized to multiple tape pairs and some enhancements are discussed.
Cite
CITATION STYLE
Kempe, A., Champarnaud, J. M., Guingne, F., & Nicart, F. (2006). WFSM auto-intersection and join algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4002 LNAI, pp. 120–131). Springer Verlag. https://doi.org/10.1007/11780885_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
