On-the fly algorithms and sequential machines

It is shown that a function is computable by an on-the-fly algorithm processing data in the most significant digit first fashion with a finite number of registers if and only if it is computable by a right subsequential finite state machine processing data in the less significant digit first fashion. Applications to the conversion of redundant into conventional representations and to canonical Booth recoding are given. The author also indicates some applications to negative or complex radix number systems.