2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/30366The "bisimulation problem" for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the bisimulation problem for deterministic rational (vectors of) boolean series on the alphabet of a dpda M. We then exhibit a complete formal system for deducing equivalent pairs of such vectors.98 pages, 4 figures, submitted to JACMLogic in Computer ScienceDiscrete MathematicsF.1.1;F.4.2;F.4.3;G.2.2text