PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA
2007 ◽
Vol 18
(04)
◽
pp. 799-811
Keyword(s):
Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints, requiring efficient ∊-transitions-removal techniques. In this paper, we present bounds on the number of new transitions for the development of acyclic WFA, which is a special case of the ∊-transitions-removal problem. We introduce a new problem, a partial removal of ∊-transitions while accepting short chains of ∊-transitions.
2018 ◽
Vol 9
(1)
◽
pp. 115-133
◽
2012 ◽
Vol 22
(03)
◽
pp. 1250020
Keyword(s):
2007 ◽
Vol 18
(06)
◽
pp. 1407-1416
◽