Fibonacci representations and finite automata

Fibonacci representations of integers provide some kinds of universal coding. It is proved that it is possible to add two integers written in the Fibonacci numeration system of order m by means of a finite-state automaton. The conversion from a Fibonacci representation to the standard binary representation cannot be realized by a finite-state automaton.