A one-to-one correspondence between two classes of ordered trees
From MaRDI portal
Publication:1123634
DOI10.1016/0020-0190(89)90048-3zbMath0677.68077MaRDI QIDQ1123634
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90048-3
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Cites Work
- Two short proofs of Kemp's identity for rooted plane trees
- On the number of deepest nodes in ordered trees
- The average number of registers needed to evaluate a binary tree optimally
- The number of registers required for evaluating arithmetic expressions
- Generating t-Ary Trees Lexicographically
- A note on plane trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item