• 因此一个图灵完备的系统可以模拟图灵机但是这个术语(即图灵等价)常常用来与图灵机等价

    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.

    youdao

  • 本文主要研究自动机方法自动机方法以及基于历史等价转换模拟最小化方法。

    In this paper, we research region automata, zone automata and the method of state space minimization based on history equivalence and bisimulation transition.

    youdao

  • 等价验证中,通常选择模拟作为等价关系

    Bisimulation is often chosen as the equivalence relation in equivalence checking.

    youdao

  • 等价验证中,通常选择模拟作为等价关系

    Bisimulation is often chosen as the equivalence relation in equivalence checking.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定