期刊文献

Bisimulation Trees and the Decidability of Weak Bisimulations 收藏

刺激树和弱同化的决定

原文求助发布源

作者

Yoram Hirshfeld

页码

2-13

来源信息

Electronic Notes in Theoretical Computer Science ISSN：1571-0661, 1997年, 5卷, 2-13页

摘要

We develop “bisimulation trees” as a means to prove decidability of weak bisimulation for restricted classes of BPP and BPA.

摘要译文

我们开发“双模拟树”作为证明限制性BPP和BPA类别的弱双模的可判定性的手段。

Yoram Hirshfeld. Bisimulation Trees and the Decidability of Weak Bisimulations[J]. Electronic Notes in Theoretical Computer Science, 1997,5: 2-13