Bijections between formulae and trees which are compatible with equivalences of the type $((f \circ g) \circ h) \sim ((f \circ h) \circ g)$

Research output: Contribution to journalArticleAcademicpeer-review

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 languageEnglish
Pages (from-to)99-105
Number of pages7
JournalDiscrete Mathematics
Volume59
Issue number1-2
DOIs
Publication statusPublished - 1986

Fingerprint Dive into the research topics of 'Bijections between formulae and trees which are compatible with equivalences of the type $((f \circ g) \circ h) \sim ((f \circ h) \circ g)$'. Together they form a unique fingerprint.

Cite this