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.
展开▼
机译：有限度方程方程的双仿真问题表明是可判定的。我们将此问题简化为dpda M字母上的确定性有理（向量的）布尔序列的/ spl eta /-双仿真问题。然后，我们展示了一个完整的形式系统，用于推导此类向量的等价对。
展开▼
