Structured Numbers. Properties of a hierarchy of internal operations in binary tress

Blondel, Vincent
(1998) Acta Informatica — Vol. 35, n° 1, p. 1-15 (1998)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 163.88 KB
Request a copy

Details

Authors
Abstract
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.
Affiliations
  • Université de LiègeInstitut de mathématiques

Citations

  • APA
  • Chicago
  • FWB

Blondel, V. (1998). Structured Numbers. Properties of a hierarchy of internal operations in binary tress. Acta Informatica, 35(1), 1-15. https://doi.org/10.1007/s002360050113 (Original work published 1998)