Rooted binary trees with weighted nodes are structures encountered in many areas, such as coding theory, searching and sorting, information storage and retrieval. The path length is a meaningful quantity which gives indications about the expected time of a search or the length of a code, for example. In this paper, two sharp bounds for the total…

The compilation of a dictionary for automatic translation from Russian to English is described in detail. Emphasis is placed on: (1) morphological and functional classifications of Russian words, (2) dictionary compilation, (3) the structure of signs, (4) automatic information-processing machines, (5) from the automatic dictionary to the automatic…