Observations on the smoothness properties of real functions computed by weighted finite automata
We continue investigations of weighted finite automata (WFA) as devices to compute real functions. Based on eigenvalues of the transition matrices of automata we provide a simple necessary condition for continuity and smoothness properties of the functions they compute. Using this condition we show that polynomials are the only smooth functions computed by WFA and that any WFA computing a polynomial of degree k must have at least k + 1 states. The results answer problems left open in [7].
smoothness weighted finite automata continuity