 |
|
|
|
| HAL: hal-00107094, version 1 |
| DOI: 10.1007/11812128_4 |
| Detailed view |  Export this paper |
|
|
| (2006) |
|
|
|
|
| Path-Equivalent Removal of Epsilon-Transitions |
|
|
| Dominique Lavenier 1Philippe Veber 1 |
|
|
| (2006) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | SYMBIOSE (INRIA - IRISA) |
|
|
|
CNRS : UMR6074 РINRIA РINSA Rennes РUniversit̩ de Rennes 1 |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Bioinformatics Life Sciences/Quantitative Methods Computer Science/Architecture |
|
|
| removal of epsilon-transitions – partial removal – weighted finite automaton – hardware acceleration – chains of epsilon-transitions |
|
| hal-00107094, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00107094 | |
| oai:hal.archives-ouvertes.fr:hal-00107094 | |
| From: Mathieu Giraud | |
| Submitted on: Tuesday, 17 October 2006 13:51:17 | |
| Updated on: Tuesday, 13 March 2007 13:47:26 | |
