Binary trees and fibred categories
组合数学
2007-05-23 v1 离散数学
范畴论
摘要
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.
引用
@article{arxiv.math/0301211,
title = {Binary trees and fibred categories},
author = {N. Raghavendra},
journal= {arXiv preprint arXiv:math/0301211},
year = {2007}
}
备注
19 pages