Skip to main content
Springer Nature Link
Log in

On computational power of weighted finite automata

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1992 (MFCS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 629))

Abstract

Weighted Finite Automata are automata with multiplicities used to compute real functions by reading infinite words. We study what kind of functions can be computed by level automata, a particular subclass of WFA. Several results concerning the continuity and the smoothness of these functions are shown. In particular, the only smooth functions that can be obtained are the polynomials. This allows to decide whether a function computed by a level automaton is smooth or not.

This work was done during the second author's visit in the University of Lille I, and was partially supported by the Esprit Basic Research Action Working Group N 3166 ASMICS and the PRC Mathematiques et Informatiques

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel and Ch. Reutenaeur, Rational Series and Their Languages, Springer-Verlag, Berlin (1988).

    Google Scholar 

  2. D. Derencourt, J. Karhumäki, M. Latteux and A. Terlutte, On Computational Power of Weighted Finite Automata, Laboratoire d'Informatique Fondamentale de Lille, Publication Interne IT223 (1991).

    Google Scholar 

  3. D. Derencourt, J. Karhumäki, M. Latteux and A. Terlutte, On Continuous Fonctions Computed By Finite Automata, Manuscript (1992).

    Google Scholar 

  4. K. Culik II and J. Karhumäki, Finite Automata Computing Real Functions, to appear.

    Google Scholar 

  5. K. Culik II and J. Kari, Image Compression Using Weighted Finite Automata, to appear.

    Google Scholar 

  6. A. Salomaa and M. Soittola, Automata-Theoretic Aspects of Formal Power Series, Springer-Verlag, Berlin (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Fondamentale de Lille, CNRS UA 369, Université de Lille I, 59655, Villeneuve d'Ascq Cedex, France

    D. Derencourt, M. Latteux & A. Terlutte

  2. Dept. of Mathematics, University of Turku, SF-20500, Turku, Finland

    J. Karhumäki

Authors
  1. D. Derencourt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Karhumäki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Latteux
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A. Terlutte
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ivan M. Havel Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Derencourt, D., Karhumäki, J., Latteux, M., Terlutte, A. (1992). On computational power of weighted finite automata. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55808-X_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-55808-X_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55808-8

  • Online ISBN: 978-3-540-47291-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics