This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On-the-Fly Algorithms and Sequential Machines
August 2000 (vol. 49 no. 8)
pp. 859-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.

[1] J.-P. Allouche, E. Cateland, W.J. Gilbert, and H.-O. Peitgen, “Automatic Maps in Exotic Numeration Systems,” Theory of Computing Systems, vol. 30, pp. 285-331, 1997.
[2] A. Avizienis, “Signed-Digit Number Representations for Fast Parallel Arithmetic,” IRE Trans. Electronic Computers, vol. 10, pp. 389-400, 1961.
[3] J. Berstel, Transductions and Context-Free Languages. Teubner, 1979.
[4] A.D. Booth, “A Signed Binary Multiplication Technique,” Quarterly J. Mechanics of Applied Math., vol. 4, pp. 236-240, 1951.
[5] C. Choffrut, “A Generalization of Ginsburg and Rose's Characterization of gsm Mappings,” Proc. Int'l Colloquium Automata, Languages, and Programming '79, pp. 88-103, 1979.
[6] S. Eilenberg, Automata, Languages, and Machines, vol. A.Academic Press, 1974.
[7] M.D. Ercegovac and T. Lang,"On-the-Fly Conversion of Redundant into Conventional Representations," IEEE Trans. Computers, vol. 36, pp. 895-897, 1987.
[8] C. Frougny, “Parallel and On-Line Addition in Negative Base and Some Complex Number Systems,” Proc. Euro-Par '96, pp. 175-182, 1996.
[9] C. Frougny, “On-the-Fly Algorithms and Sequential Machines,” Proc. 13th IEEE Symp. Computer Arithmetic, pp. 260-265, 1997.
[10] C. Frougny and J. Sakarovitch, “Synchronisation déterministe des automatesàdélai borné,” Theoretical Computer Science, vol. 191, pp. 61-77, 1998.
[11] I. Kátai and J. Szabó, “Canonical Number Systems for Complex Integers,” Acta Science and Math., vol. 37, pp. 255-280, 1975.
[12] D. Knuth, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, Mass., 1998.
[13] P. Kornerup, “Digit-Set Conversions: Generalizations and Applications,” IEEE Trans. Computers, vol. 43, pp. 622-629, 1994.
[14] D. Matula, “Basic Digit Sets for Radix Representation,” J. ACM, vol. 29, pp. 1,131-1,143, 1982.
[15] M. Mohri, “Minimization of Sequential Transducers,” Proc. Symp. Theoretical Aspects in Computer Science '94, pp. 151-163, 1994.
[16] P. Montuschi and L. Ciminiera, “$n \times n$Carry-Save Multipliers without Final Addition,” Proc. 11th IEEE Symp. Computer Arithmetic, pp. 54-61, 1993.
[17] J.-M. Muller, “Some Characterizations of Functions Computable in On-Line Arithmetic,” IEEE Trans. Computers, vol. 43, pp. 752-755, 1994.
[18] A.M. Nielsen and J.-M. Muller, “Borrow-Save Adders for Real and Complex Number Systems,” Proc. Conf. Real Numbers and Computers, pp. 121-137, 1996.
[19] K.S. Trivedi and M.D. Ercegovac, “On-Line Algorithms for Division and Multiplication,” IEEE Trans. Computers, vol. 26, pp. 681-687, 1977.

Index Terms:
On-the-fly algorithm, sequential machine, digit set conversion.
Citation:
Christiane Frougny, "On-the-Fly Algorithms and Sequential Machines," IEEE Transactions on Computers, vol. 49, no. 8, pp. 859-863, Aug. 2000, doi:10.1109/12.868030
Usage of this product signifies your acceptance of the Terms of Use.