Sciweavers

IJFCS
2007

Path-Equivalent Developments in Acyclic Weighted Automata

13 years 11 months ago
Path-Equivalent Developments in Acyclic Weighted Automata
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.
Mathieu Giraud, Philippe Veber, Dominique Lavenier
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IJFCS
Authors Mathieu Giraud, Philippe Veber, Dominique Lavenier
Comments (0)