有限出度方程图的互模拟问题
The Bisimulation Problem for equational graphs of finite out-degree
摘要:
证明了有限出度的方程图的互模拟问题是可判定的。我们把这个问题归结为确定性有理(向量)布尔级数在dpda M字母表上的互模拟问题。然后,我们展示了一个完整的正式系统,推导出等价对这样的向量。
英文摘要:
The "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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。