Skip to main content
Conference Proceedings

The removal of weighted ε-transitions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7381 LNCS 345-352
DOI: 10.1007/978-3-642-31606-7_31
7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The removal of ε-transitions in weighted automata leads to infinite summation when cycles of such transitions are allowed. This paper presents both an algorithm for that purpose, and a framework in which the algorithm is correct. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Lombardy, S., & Sakarovitch, J. (2012). The removal of weighted ε-transitions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7381 LNCS, pp. 345–352). https://doi.org/10.1007/978-3-642-31606-7_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free