DocumentCode
1380341
Title
On-the-fly algorithms and sequential machines
Author
Frougny, Christiane
Author_Institution
L.I.A.F.A., Paris, France
Volume
49
Issue
8
fYear
2000
fDate
8/1/2000 12:00:00 AM
Firstpage
859
Lastpage
863
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;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.868030
Filename
868030
Link To Document