On-line finite automata for addition in some numeration systems
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 33 (1999) no. 1, pp. 79-101.
@article{ITA_1999__33_1_79_0,
     author = {Frougny, Christiane},
     title = {On-line finite automata for addition in some numeration systems},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {79--101},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {1},
     year = {1999},
     zbl = {0927.68052},
     mrnumber = {1705857},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1999__33_1_79_0/}
}
TY  - JOUR
AU  - Frougny, Christiane
TI  - On-line finite automata for addition in some numeration systems
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1999
DA  - 1999///
SP  - 79
EP  - 101
VL  - 33
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1999__33_1_79_0/
UR  - https://zbmath.org/?q=an%3A0927.68052
UR  - https://www.ams.org/mathscinet-getitem?mr=1705857
LA  - en
ID  - ITA_1999__33_1_79_0
ER  - 
%0 Journal Article
%A Frougny, Christiane
%T On-line finite automata for addition in some numeration systems
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1999
%P 79-101
%V 33
%N 1
%I EDP-Sciences
%G en
%F ITA_1999__33_1_79_0
Frougny, Christiane. On-line finite automata for addition in some numeration systems. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 33 (1999) no. 1, pp. 79-101. http://www.numdam.org/item/ITA_1999__33_1_79_0/

[1] J.-P. Allouche, E. Cateland, W. J. Gilbert, H.-O. Peitgen, J. O. Shallit and G. Skordev, Automatic maps in exotic numeration systems. Theory Comput. Syst. 30 (1997) 285-331. | MR | Zbl

[2] T. Aoki, H. Amada and T. Higuchi, Real/complex reconfigurable arithmetic using redundant complex number systems, in Proc. 13th Symposium on Computer Arithmetic (1997) 200-207.

[3] A. Avizienis, Signed-digit number representations for fast parallel arithmetic. IEE Trans. Electron. Comput. 10 (1961) 389-400. | MR

[4] M. P. Béal, Codage symbolique, Masson (1993).

[5] J. Berstel, Transductions and Context-free Languages, Teubner (1979). | MR | Zbl

[6] J. Berstel, Fonctions rationnelles et addition. Actes de l'École de Printemps de Théorie des Langages, LITP (1982) 177-183.

[7] J. Berstel, Fibonacci words - A survey, The book of L, Springer-Verlag (1986) 13-27. | Zbl

[8] C. Y. Chow and J. E. Robertson, Logical design of a redundant binary adder, in Proc. 4th Symposium on Computer Arithmetic (1978) 109-115.

[9] C. Choffrut, Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles. Theoret. Comput. Sci. 5 (1977) 325-337. | MR | Zbl

[10] J. Duprat, Y. Herreros and S. Kla, New redundant representations of complex numbers and vectors. IEE Trans. Comput. C-42 (1993) 817-824. | MR

[11] S. Eilenberg, Automata, languages and machines, Vol. A (Academic Press, 1974). | MR | Zbl

[12] M. D. Ercegovac, On-line arithmetic: An overview. Real time Signal Processing VII SPIE 495 (1984) 86-93.

[13] Ch. Frougny, Confluent linear numeration systems. Theoret. Comput. Sci. 106 (1992) 183-219. | MR | Zbl

[14] Ch. Frougny, Representation of numbers and finite automata. Math. Systems Theory 25 (1992) 37-60. | MR | Zbl

[15] Ch. Frougny, Parallel and on-line addition in negative base and some complex number systems, in Proc. of the Conference Euro-Par 96, Springer, Lyon, L.N.C.S. 1124 (1996) 175-182.

[16] Ch. Frougny and J. Sakarovitch, Synchronisation déterministe des automates à délai borné. Theoret. Comput. Sci. 191 (1998) 61-77. | MR | Zbl

[17] W. Gilbert, Radix representations of quadratic field. J. Math. Anal. Appl. 83 (1981) 264-274. | MR | Zbl

[18] Y. Herreros, Contribution à l'arithmétique des ordinateurs, Ph. D. Dissertation, I.N.P.G., Grenoble, France (1991).

[19] I. Kátai and J. Szabó, Canonical number Systems. Acta Sci. Math. 37 (1975) 255-280. | MR | Zbl

[20] D. E. Knuth, An imaginary number system. CACM 3 (1960) 245-247. | MR

[21] D. E. Knuth, The art of computer programming, Seminumerical Algorithms, Vol. 2, 2nd ed. (Addison-Wesley, 1988). | MR

[22] S. Körmendi, Classical number systems in Q[3√2]. Acta Sci. Math. 50 (1986) 351-357. | Zbl

[23] D. Lind and B. Marcus, An introduction to symbolic dynamics and coding, Cambridge University Press (1995). | MR | Zbl

[24] D. W. Matula, Basic digit sets for radix representation. JACM 29 (1982) 1131-1143. | MR | Zbl

[25] J.-M. Muller, Some characterizations of fonctions computable in on-line arithmetic. IEE Trans. Comput. 43 (1994) 752-755. | MR | Zbl

[26] A. M. Nielsen and J.-M. Muller, Borrow-save adders for real and complex number systems, in Proc. of the Conference Real Numbers and Computers, Marseille (1996) 121-137.

[27] K. Pekmestzi, Complex numbers multipliers. IEE Proc. Computers and Digital Techniques 136 (1989) 70-75.

[28] W. Penney, A "binary" system for complex numbers. JACM 12 (1965) 247-248. | Zbl

[29] A. Rényi, Representations for real numbers and their ergodic properties. Acta Math. Acad. Sci. Hungar. 8 (1957) 477-493. | MR | Zbl

[30] A. Robert, A good basis for computing with complex numbers. El. Math. 49 (1994) 111-117. | EuDML | MR | Zbl

[31] T. Safer, Radix representations of algebraic number fields and finite automata, in Proc. Stacs'98, LNCS 1373 (1998) 356-365. | MR | Zbl

[32] K. S. Trivedi and M. D. Ercegovac, On-line algorithms for division and multiplication. IEE Trans. Comput. C 26 (1977) 681-687. | MR | Zbl

[33] O. Vaysse, Addition molle et fonctions p-locales. Semigroup Forum 34 (1986) 157-175. | EuDML | MR | Zbl