Skip to main content
SpringerLink
Log in

The Removal of Weighted ε-Transitions

  • Conference paper
Book cover Implementation and Application of Automata (CIAA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7381))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J., Reutenauer, C.: Les séries rationnelles et leurs langages. Masson (1984); translation: Rational Series and Their Languages. Springer (1988)

    Google Scholar 

  2. Ésik, Z., Kuich, W.: Finite automata. In: Droste, M., et al. (eds.) Handbook of Weighted Automata, pp. 69–104. Springer (2009)

    Google Scholar 

  3. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Springer (1986)

    Google Scholar 

  4. Lombardy, S., Sakarovitch, J.: On the weighted closure problem. Available on ArXiV (to appear, 2012)

    Google Scholar 

  5. Lombardy, S., Sakarovitch, J.: Derivation of rational expressions with multiplicity. Theoret. Computer Sci. 332, 141–177 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Mohri, M.: Generic ε-removal and input ε-normalization algorithms for weighted transducers. Int. J. Foundations Computer Sci. 13, 129–143 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009); corrected English translation of Éléments de théorie des automates, Vuibert (2003)

    Google Scholar 

  8. Sakarovitch, J.: Rational and recognisable power series. In: Droste, M., et al. (eds.) Handbook of Weighted Automata, pp. 105–174. Springer (2009)

    Google Scholar 

  9. Vaucanson , www.vaucanson-project.org

Download references

Author information

Authors and Affiliations

  1. LIGM, Université Paris-Est Marne-la-Vallée, France

    Sylvain Lombardy

  2. LTCI, CNRS, Telecom ParisTech, France

    Jacques Sakarovitch

Authors
  1. Sylvain Lombardy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Sakarovitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055, 4169-007, Porto, Portugal

    Nelma Moreira  & Rogério Reis  & 

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation