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.
Work Supported by ANR Project 10-INTB-0203 VAUCANSON 2.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berstel, J., Reutenauer, C.: Les séries rationnelles et leurs langages. Masson (1984); translation: Rational Series and Their Languages. Springer (1988)
Ésik, Z., Kuich, W.: Finite automata. In: Droste, M., et al. (eds.) Handbook of Weighted Automata, pp. 69–104. Springer (2009)
Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Springer (1986)
Lombardy, S., Sakarovitch, J.: On the weighted closure problem. Available on ArXiV (to appear, 2012)
Lombardy, S., Sakarovitch, J.: Derivation of rational expressions with multiplicity. Theoret. Computer Sci. 332, 141–177 (2005)
Mohri, M.: Generic ε-removal and input ε-normalization algorithms for weighted transducers. Int. J. Foundations Computer Sci. 13, 129–143 (2002)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009); corrected English translation of Éléments de théorie des automates, Vuibert (2003)
Sakarovitch, J.: Rational and recognisable power series. In: Droste, M., et al. (eds.) Handbook of Weighted Automata, pp. 105–174. Springer (2009)
Vaucanson , www.vaucanson-project.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lombardy, S., Sakarovitch, J. (2012). The Removal of Weighted ε-Transitions. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-31606-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31605-0
Online ISBN: 978-3-642-31606-7
eBook Packages: Computer ScienceComputer Science (R0)