Applied Tree Enumerations

@inproceedings{Dershowitz1981AppliedTE,
  title={Applied Tree Enumerations},
  author={Nachum Dershowitz and Shmuel Zaks},
  booktitle={CAAP},
  year={1981}
}
In this paper we consider the class T of ordered trees with n edges and give n combinntorial proofs to several enumeration formulae concerning T. In particular, n closed-form expressions are given for (1) the number of trees in T with n leaves, n 0 n1 unary nodes,. .. , nd nodes with d children, and no restrictions on nodes with more than d children, and for (2) the number of nodes in T on level R with d chil-n dren. Several statistical results are derived from these. The combinatorial tools we… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Orderings -for term-rewriting -systems, to appear in

  • N O Dershowitz
  • J. Theoretical Computer Science
  • 1981

Lattice Path Counting and Applications

  • S Go, Mohanty
  • Lattice Path Counting and Applications
  • 1979

On the altitude of nodes in random trees, Can

  • A Meir, J Moon
  • On the altitude of nodes in random trees, Can
  • 1978

Similar Papers

Loading similar papers…