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

DOI10.1016/0012-365X(86)90073-7zbMath0596.05021MaRDI QIDQ1078190

R. P. Nederpelt

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

equivalence relationtrivalent ordered trees

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Unnamed Item
• Correspondences between plane trees and binary sequences
• The Number of Numerical Outcomes of Iterated Powers

This page was built for publication: Bijections between formulae and trees which are compatible with equivalences of the type ((f\(\circ g)\circ h)\sim ((f\circ h)\circ g)\)