Weighted finite automata (WFA) are used with accelerating hardware to scan large genomic banks. Hardwiring such automata raise surface area and clock frequency constraints, requiring efficient ε-transitions-removal techniques. In this paper, we present new bounds on the number of new transitions for several ε-transitions-removal problems. We study the case of acyclic WFA. We introduce a new problem, the partial removal of ε-transitions while accepting short chains of ε-transitions. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Giraud, M., Veber, P., & Lavenier, D. (2006). Path-equivalent removals of ε-transitions in a genomic weighted finite automaton. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4094 LNCS, pp. 23–33). Springer Verlag. https://doi.org/10.1007/11812128_4
Mendeley helps you to discover research relevant for your work.