Binary trees and fibred categories
<|reference_start|>Binary trees and fibred categories: 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.<|reference_end|>
@article{raghavendra2003binary,
    title={Binary trees and fibred categories},
    author={N. Raghavendra},
    journal={arXiv preprint arXiv:math/0301211},
    year={2003},
    archivePrefix={arXiv},
    eprint={math/0301211},
    primaryClass={math.CO cs.DM math.CT}
}