Path-equivalent developments in acyclic weighted automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Foundations of Computer Science Year : 2007

Path-equivalent developments in acyclic weighted automata

Abstract

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.
Fichier principal
Vignette du fichier
gvl-ijfcs-07-preprint.pdf (272.83 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

inria-00271646 , version 1 (09-04-2008)

Identifiers

Cite

Mathieu Giraud, Philippe Veber, Dominique Lavenier. Path-equivalent developments in acyclic weighted automata. International Journal of Foundations of Computer Science, 2007, 18 (4), pp.799-812. ⟨10.1142/S012905410700498X⟩. ⟨inria-00271646⟩
502 View
148 Download

Altmetric

Share

Gmail Facebook X LinkedIn More