Skip to Main content Skip to Navigation
Conference papers

Path-Equivalent Removal of Epsilon-Transitions

Dominique Lavenier 1 Philippe Veber 1 Mathieu Giraud 1 
1 SYMBIOSE - Biological systems and models, bioinformatics and sequences
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : 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 epsilon-transitions removal techniques. In this paper, we present new bounds on the number of new transitions for several epsilon-transitions removal problems. We study the case of acyclic WFA. We introduce a new problem, the partial removal of epsilon-transitions while accepting short chains of epsilon-transitions.
Complete list of metadata
Contributor : Mathieu Giraud Connect in order to contact the contributor
Submitted on : Tuesday, October 17, 2006 - 1:51:17 PM
Last modification on : Friday, February 4, 2022 - 3:23:17 AM

Links full text



Dominique Lavenier, Philippe Veber, Mathieu Giraud. Path-Equivalent Removal of Epsilon-Transitions. 2006, pp.23--33, ⟨10.1007/11812128_4⟩. ⟨hal-00107094⟩



Record views