Generic ε-removal algorithm for weighted automata

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

Abstract

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
PublisherSpringer Verlag
Pages230-242
Number of pages13
Volume2088
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)
Volume2088
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Conference on Implementation and Application of Automata, CIAA 2000
CountryCanada
CityLondon
Period7/24/007/25/00

Fingerprint

Weighted Automata
Semiring
Transducer
Transducers
Automata
Approximation algorithms
Time Complexity
Queue
Approximation Algorithms

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Mohri, M. (2001). Generic ε-removal algorithm for weighted automata. In Implementation and Application of Automata - 5th International Conference, CIAA 2000, Revised Papers (Vol. 2088, pp. 230-242). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2088). Springer Verlag.

Generic ε-removal algorithm for weighted automata. / Mohri, Mehryar.

Implementation and Application of Automata - 5th International Conference, CIAA 2000, Revised Papers. Vol. 2088 Springer Verlag, 2001. p. 230-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2088).

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

Mohri, M 2001, Generic ε-removal algorithm for weighted automata. in Implementation and Application of Automata - 5th International Conference, CIAA 2000, Revised Papers. vol. 2088, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2088, Springer Verlag, pp. 230-242, 5th International Conference on Implementation and Application of Automata, CIAA 2000, London, Canada, 7/24/00.
Mohri M. Generic ε-removal algorithm for weighted automata. In Implementation and Application of Automata - 5th International Conference, CIAA 2000, Revised Papers. Vol. 2088. Springer Verlag. 2001. p. 230-242. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Mohri, Mehryar. / Generic ε-removal algorithm for weighted automata. Implementation and Application of Automata - 5th International Conference, CIAA 2000, Revised Papers. Vol. 2088 Springer Verlag, 2001. pp. 230-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6a83f9ad6cc340179f670fe7df98443d,
title = "Generic ε-removal algorithm for weighted automata",
abstract = "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.",
author = "Mehryar Mohri",
year = "2001",
language = "English (US)",
isbn = "3540424911",
volume = "2088",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "230--242",
booktitle = "Implementation and Application of Automata - 5th International Conference, CIAA 2000, Revised Papers",

}

TY - GEN

T1 - Generic ε-removal algorithm for weighted automata

AU - Mohri, Mehryar

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84954417120&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84954417120&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84954417120

SN - 3540424911

SN - 9783540424918

VL - 2088

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 230

EP - 242

BT - Implementation and Application of Automata - 5th International Conference, CIAA 2000, Revised Papers

PB - Springer Verlag

ER -