N. Raghavendra
Published 2003-01-20Version 1
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to transition systems, which arise in the theory of concurrent computing.
A note on limits of sequences of binary trees
Some extremal ratios of the distance and subtree problems in binary trees
Supersolvable LL-lattices of binary trees
![QR code for arXiv:math/0301211 [math.CO]](http://oss.arxitics.com/images/favicon.svg)