2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/172793We consider a boolean network whose interaction graph has no circuit of length >1. Under this hypothesis, we establish an upper bound on the length of the attractors of the network which only depends on its interaction graph.7 pagesDiscrete Mathematicstext