Generic ε-removal algorithm for weighted automata

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We present a new generic ε -removal algorithm for weighted automata and transducers defied 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 also illus-trate the use of the algorithm with several semirings.

Original languageEnglish (US)
Title of host publicationImplementation and Application of Automata - 5th International Conference, CIAA 2000, Revised Papers
EditorsSheng Yu, Andrei Paun
PublisherSpringer Verlag
Number of pages13
ISBN (Print)3540424911, 9783540424918
StatePublished - 2001
Event5th International Conference on Implementation and Application of Automata, CIAA 2000 - London, Canada
Duration: Jul 24 2000Jul 25 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other5th International Conference on Implementation and Application of Automata, CIAA 2000

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Generic ε-removal algorithm for weighted automata'. Together they form a unique fingerprint.

Cite this