Decidability of bisimulation equivalence for equational graphs of finite out-degree
Géraud Sénizergues · 2002
The bisimulation problem for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the /spl eta/-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.