Title :
On-the-fly algorithms and sequential machines
Author :
Frougny, Christiane
Author_Institution :
L.I.A.F.A., Paris, France
fDate :
8/1/2000 12:00:00 AM
Abstract :
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
Keywords :
finite state machines; sequential machines; complex radix number systems; finite state machine; least significant digit first; most significant digit first; on-the-fly algorithms; sequential machines; Application software; Automata; Concurrent computing; Digital arithmetic; Propagation delay; Registers; Storage automation;
Journal_Title :
Computers, IEEE Transactions on
