Path-Equivalent Removal of Epsilon-Transitions - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Path-Equivalent Removal of Epsilon-Transitions


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.

Dates and versions

hal-00107094 , version 1 (17-10-2006)



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



Gmail Mastodon Facebook X LinkedIn More