Binary trees and fibred categories
classification
🧮 math.CO
cs.DMmath.CT
keywords
binarycategorygraphsfibredtreesariseautomatacategories
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.