ON COMPUTATIONAL POWER OF WEIGHTED FINITE AUTOMATA
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte · Fundamenta Informaticae · 1996
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.