@inproceedings{f38bdbf1098741d2bdb256096d791390,

title = "Applied tree enumerations",

author = "Nachum Dershowitz and Shmuel Zaks",

note = "Funding Information: We consider ordered trees (see Knuth [1968] for definitions). Each node has a degree (the number of its children). A node of degree 0 is termed a leaf; otherwise it is called an internal node. The level of a node is its distance from the root (the root is on level 0). The number of trees in the set T n of ordered trees with n edges is the well-known Catalan number ~Research supported in part by the National Science Foundation under Grant MCS 79-04897.; 6th Colloquium on Trees in Algebra and Programming, CAAP 1981 ; Conference date: 05-03-1981 Through 07-03-1981",

year = "1981",

doi = "10.1007/3-540-10828-9_62",

language = "אנגלית",

isbn = "9783540108283",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "180--193",

editor = "Egidio Astesiano and Corrado Bohm",

booktitle = "CAAP 1981",

}