ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES
2008 ◽
Vol 19
(02)
◽
pp. 453-476
◽
Keyword(s):
A weighted finite-state machine with n tapes describes a rational relation on n strings. We recall some basic operations on n-ary rational relations, recast the important join operation in terms of "auto-intersection", and propose restricted algorithms for both operations. If two rational relations are joined on more than one tape, it can unfortunately lead to non-rational relations with undecidable properties. As a consequence, there cannot be a fully general algorithm, able to compile any rational join or auto-intersection. We define a class of triples 〈A,i,j〉 for which we are able to compile the auto-intersection of the machine A w.r.t. tapes i and j. We hope that this class is sufficient for many practical applications.
2007 ◽
Vol 17
(4)
◽
pp. 565-575
◽
2017 ◽
Vol 13
(08)
◽
pp. 147
◽
Keyword(s):
2021 ◽
Vol 2066
(1)
◽
pp. 012063
Keyword(s):
Keyword(s):
2015 ◽
Vol 24
(07)
◽
pp. 1550101
◽
Keyword(s):