ON COMPUTATIONAL POWER OF WEIGHTED FINITE AUTOMATA

  • Authors:

  • D. Derencourt;J. Karhumäki;M. Latteux;A. Terlutte

  • Affiliations:

  • Laboratoire d'Informatique Fondamentale de Lille, CNRS UA 369, Université de Lille I, 59655 Villeneuve d'Ascq Cedex, France;Dept. of Mathematics, University of Turku, SF-20500 Turku, Finland;Laboratoire d'Informatique Fondamentale de Lille, CNRS UA 369, Université de Lille I, 59655 Villeneuve d'Ascq Cedex, France;Laboratoire d'Informatique Fondamentale de Lille, CNRS UA 369, Université de Lille I, 59655 Villeneuve d'Ascq Cedex, France

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

Weighted Finite Automata are automata with multiplicities used to compute real functions by reading infinite words. The aim of this paper is to 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 enables to decide whether a function computed by a level automaton is smooth or not.