Chapter

Implementation and Application of Automata

Volume 4094 of the series Lecture Notes in Computer Science pp 23-33

Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton

  • Mathieu GiraudAffiliated withIRISA / CNRS / Université de Rennes 1
  • , Philippe VeberAffiliated withIRISA / CNRS / Université de Rennes 1
  • , Dominique LavenierAffiliated withIRISA / CNRS / Université de Rennes 1

* Final gross prices may vary according to local VAT.

Get Access

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 ε-transitions-removal techniques. In this paper, we present new bounds on the number of new transitions for several ε-transitions-removal problems. We study the case of acyclic WFA. We introduce a new problem, the partial removal of ε-transitions while accepting short chains of ε-transitions.