Title :
Recurrent neural networks and Fibonacci numeration system of order s(s⩾2)
Author_Institution :
Univ. de Paris-Nord, Villetaneuse, France
fDate :
27 Jun-2 Jul 1994
Abstract :
In the Fibonacci numeration system of order s(s⩾2), every positive integer admits a unique representation which does not contain s consecutive digits equal to 1 (called normal form). We show how this normal form can be obtained from any representation by recurrent neural networks. The addition of two integers in this system and the conversion from a Fibonacci representation to a standard binary representation (and conversely) can also be realized using recurrent neural networks
Keywords :
number theory; recurrent neural nets; Fibonacci numeration system; recurrent neural networks; Automata; Computational modeling; Computer networks; Computer science; Decoding; Encoding; Power system modeling; Recurrent neural networks;
Conference_Titel :
Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on
Conference_Location :
Orlando, FL
Print_ISBN :
0-7803-1901-X
DOI :
10.1109/ICNN.1994.374510
