A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binaryâ€¦ (More)

It is shown that a stationary distribution of a regular Markov chain can be obtained directly from its transition graph. The technique is similar to signal flow-graph methods, however, it uses treesâ€¦ (More)

A class of finite-memory deterministic algorithms is introduced and investigated. Opt imum algorithms are found for small numbers (up to 21) of states. The algorithms provide their own stopping rules.