Blondel, Vincent
[Université de Liège]
We introduce a hierarchy of operations on (finite and infinite) binary trees. The operations are obtained by successive repetition of one initial operation. The first three operations are generalizations of the operations of addition, multiplication and exponentiation for positive integers.
Bibliographic reference |
Blondel, Vincent. Structured Numbers. Properties of a hierarchy of internal operations in binary tress. In: Acta Informatica, Vol. 35, no. 1, p. 1-15 (1998) |
Permanent URL |
http://hdl.handle.net/2078/95287 |