Binary trees and fibred categories

Simple item page
dc.creatorRaghavendra, N.
dc.date2003-01-20
dc.date.accessioned2026-07-07T04:54:33Z
dc.date.available2026-07-07T04:54:33Z
dc.descriptionWe 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.
dc.description19 pages
dc.identifierhttps://arxiv.org/abs/math/0301211
dc.identifierhttp://arxiv.org/abs/math/0301211
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66298
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subjectCategory Theory
dc.subject05C05 (Primary) 18D30, 05C62, 18B20, 68Q85 (Secondary)
dc.titleBinary trees and fibred categories
dc.typetext

Files

Collections

arXiv