Enumerations of ordered trees
From MaRDI portal
Publication:1144044
DOI10.1016/0012-365X(80)90168-5zbMath0443.05049WikidataQ56169635 ScholiaQ56169635MaRDI QIDQ1144044
Shmuel Zaks, Nachum Dershowitz
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (39)
XML compression via directed acyclic graphs ⋮ Protected Branches in Ordered Trees ⋮ Two shortest path metrics on well-formed parentheses strings ⋮ A new combinatorial interpretation for generalized Catalan number ⋮ A refinement of Dyck paths: A combinatorial approach ⋮ Some remarks on Catalan families ⋮ Ordered trees and non-crossing partitions ⋮ A shift Gray code for fixed-content Łukasiewicz words ⋮ Unnamed Item ⋮ Combinatorics of diagonally convex directed polyominoes ⋮ A refinement of leaves on noncrossing trees ⋮ A Combinatorial Bijection between Ordered Trees and Lattice Paths ⋮ The number of coverings in four catalan lattices ⋮ RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm. ⋮ Enumerations of rooted trees with an application to group presentations ⋮ Enumerations of plane trees with multiple edges and Raney lattice paths ⋮ A note on generating binary trees inA-order andB-order ⋮ An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees ⋮ Generating trees withnnodes andmleaves ⋮ The butterfly decomposition of plane trees ⋮ A bijection on ordered trees and its consequences ⋮ 2-binary trees: bijections and related issues ⋮ The permuted analogues of three Catalan sets ⋮ Parametric analysis of RNA branching configurations ⋮ Quasi-Monotonic Sequences: Theory, Algorithms and Applications ⋮ Ordered trees and the inorder traversal ⋮ Patterns in trees ⋮ Skew diagrams and ordered trees ⋮ The expected additive weight of trees ⋮ Odd or even on plane trees ⋮ Six etudes in generating functions ⋮ On the average oscillation of a stack ⋮ A simple proof of a formula of Dershowitz and Zaks ⋮ Permutations, parenthesis words, and Schröder numbers ⋮ A correspondence between ordered trees and noncrossing partitions ⋮ Dyck path enumeration ⋮ A pattern of asymptotic vertex valency distributions in planar maps ⋮ Sur la génération des arbres binaires par les B-suites ⋮ Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers
Cites Work
This page was built for publication: Enumerations of ordered trees
