Titlebook: Automata Theory and Formal Languages; 2nd GI Conference, K H. Brakhage Conference proceedings 1975 Springer-Verlag Berlin Heidelberg 1975 A

轻而薄

Best possible bounds on the weighted path length of optimum binary search trees,We derive upper and lower bounds for the weighted path length P. of optimum binary search trees. In particular, 1/log3 H≤P.≤2+H where H is the entropy of the frequency distribution. We also present an approximation algorithm which constructs nearly optimal trees.

Dawdle

几何学家

,The complexity of negation-limited networks — A brief survey, term of order n.log.n is saved. However, for sets of lower inversion complexity, no interesting bounds are known on the amount of savings possible. Good upper bounds on the amount of such savings would enable lower bounds on combinational complexity to be concluded from lower bounds on the negation-restricted complexity.

昏睡中

确定

把…比做

Langages algebriques deterministes et groupes abeliens,

galley

亲密

,Über den mittleren Zeitbedarf bei der LR(k) — Analyse kontextfreier Sprachen,

Decline

玉米棒子

The network-complexity of equivalence and other applications of the network complexity,