Abstract
We describe a bijection which maps trivalent ordered trees, representing certain formulae, onto ordered trees. The mapping is such that an equivalence relation of the type ((ƒ·g)·h)((ƒ·h)·g) on the set of formulae, induces the equivalence relation of being equal modulo order on the set of ordered trees.
Original language | English |
---|---|
Pages (from-to) | 99-105 |
Number of pages | 7 |
Journal | Discrete Mathematics |
Volume | 59 |
Issue number | 1-2 |
DOIs | |
Publication status | Published - 1986 |