Bijections between formulae and trees which are compatible with equivalences of the type $((f \circ g) \circ h) \sim ((f \circ h) \circ g)$
| Jazyk: | angličtina |
|---|---|
| Rok vydání: | 1986 |
| Zdroj: | Discrete Mathematics. 59(1-2):99-105 |
| ISSN: | 0012-365X |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|