Issue No. 08 - August (2000 vol. 49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.868030
<p><b>Abstract</b>—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 deterministically data in the least significant digit first fashion. Some applications to complex radix number systems are given.</p>
On-the-fly algorithm, sequential machine, digit set conversion.
C. Frougny, "On-the-Fly Algorithms and Sequential Machines," in IEEE Transactions on Computers, vol. 49, no. , pp. 859-863, 2000.