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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00107094
Contributeur : Mathieu Giraud <>
Soumis le : mardi 17 octobre 2006 - 13:51:17
Dernière modification le : vendredi 16 novembre 2018 - 01:25:21

Lien texte intégral

Identifiants

Citation

Dominique Lavenier, Philippe Veber, Mathieu Giraud. Path-Equivalent Removal of Epsilon-Transitions. 2006, Springer, pp.23--33, 2006, LNCS 4094. 〈10.1007/11812128_4〉. 〈hal-00107094〉

Partager

Métriques

Consultations de la notice

320