Generic -removal and input -normalization algorithms for weighted transducers

Research output: Contribution to journalArticlepeer-review


We present a new generic -removal algorithm for weighted automata and transducers defined over a semiring. The algorithm can be used with any semiring covered by our framework and works with any queue discipline adopted. It can be used in particular in the case of unweighted automata and transducers and weighted automata and transducers defined over the tropical semiring. It is based on a general shortest-distance algorithm that we briefly describe. We give a full description of the algorithm including its pseudocode and its running time complexity, discuss the more efficient case of acyclic automata, an on-the-fly implementation of the algorithm and an approximation algorithm in the case of the semirings not covered by our framework. We illustrate the use of the algorithm with several semirings. We also describe an input -normalization algorithm for weighted transducers based on the general shortest-distance algorithm. The algorithm, which works with all semirings covered by our framework, admits an on-the-fly implementation.

Original languageEnglish (US)
Pages (from-to)129-143
Number of pages15
JournalInternational Journal of Foundations of Computer Science
Issue number1
StatePublished - 2002


  • -removal
  • finite automata
  • finite-state transducers
  • rational power series
  • semirings
  • shortest-paths algorithms

ASJC Scopus subject areas

  • Computer Science (miscellaneous)


Dive into the research topics of 'Generic -removal and input -normalization algorithms for weighted transducers'. Together they form a unique fingerprint.

Cite this