因此，一个图灵完备的系统可以模拟图灵机，但是这个术语(即图灵等价)常常被用来指与图灵机等价。
Thus, a Turing-complete system is one that can simulate a Turing machine, but the term is most often used to mean Turing equivalent to a Turing machine.
本文主要研究了域自动机方法、带自动机方法以及基于历史等价和转换互模拟的最小化方法。
In this paper, we research region automata, zone automata and the method of state space minimization based on history equivalence and bisimulation transition.
在等价验证中，通常选择互模拟作为等价关系。
Bisimulation is often chosen as the equivalence relation in equivalence checking.
应用推荐