Finite Automata Computing Real Functions
Karel Čulík, Juhani Karhumäki · SIAM Journal on Computing · 1994
A new application of finite automata as computers of real functions is introduced. It is shown that even automata with a restricted structure compute all polynomials, many fractal-like and other functions. Among the results shown, the authors give necessary and sufficient conditions for continuity, show that continuity and equivalence are decidable properties, and show how to compute integrals of functions in the automata representation.