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

  • Mathieu Giraud
  • Philippe Veber
  • Dominique Lavenier
Conference paper

DOI: 10.1007/11812128_4

Volume 4094 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Giraud M., Veber P., Lavenier D. (2006) Path-Equivalent Removals of ε-transitions in a Genomic Weighted Finite Automaton. In: Ibarra O.H., Yen HC. (eds) Implementation and Application of Automata. CIAA 2006. Lecture Notes in Computer Science, vol 4094. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mathieu Giraud
    • 1
  • Philippe Veber
    • 1
  • Dominique Lavenier
    • 1
  1. 1.IRISA / CNRS / Université de Rennes 1RennesFrance