有限自动机用英语怎么说,有限自动机的英文翻译


词语导航

基本信息

词语:有限自动机

繁体:有限自動機

拼音:yǒu xiàn zì dòng jī

英语翻译

【计】 finit automation; finite-state machine

分词翻译

有限自动的英语翻译:

【计】 finite automaton

机的英语翻译:

chance; crucial point; engine; machine; occasion; organic; pivot; plane
flexible
【医】 machine

翻译例句

1. 但是为了提高效率,最好使用确定性有限自动机。

Yet for increased efficiency, it is best to work with deterministic finite automaton.

2. 简介,有限自动机,正则运算式。

Introduction, Finite Automata, Regular Expressions.WwW.WentiYi.COm

3. 这样的表用来实现非确定性有限自动机(NFA)。

Such a table is used to implement nondeterministic finite automaton (NFA).

4. 结果表明:用有限自动机就可以接收该极限语言。

The result shows that the finite automaton can accept this limit set.

5. 该文讨论的是基于有限自动机理论的公钥加密体制。

In this paper we discuss one public key cryptosystem which based on the theory of the finite automaton.

6. 在该系统中,使用了扩充的有限自动机和启发式搜索等技术。

The system includes a extended finite automata and heuristic search technique.

7. 前馈逆有限自动机的结构是有限自动机可逆性理论中的基本问题。

The structure of feedforward inverse finite automata is a fundamental problem in the invertibility theory of finite automata.

8. 本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。

This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.

9. 其中的有限自动机模型在文本处理、编译程序以及硬件设计等等中非常有用。

The finite automaton model is used in text processing, compilers, hardware design and the like.

10. 该方法适宜于计算机编程操作,因此可方便地用于多输入多状态有限自动机的综合。

The method fit for the program operation of the computer can be easily used for the synthesis of a finite automation with multi-input and multi-state.

11. 基于确定性有限自动机(DFA)的多模式匹配算法被广泛用于数据包深度检测系统中。

The multi-pattern algorithm based on Deterministic Finite Automata(DFA) is commonly used in deep packet inspection systems.

12. 对于一类具有状态和有限自动机输出时滞的离散混合系统,给出了混合观测器的设计方法。

An observers design methodology was proposed for a kind of discrete hybrid systems with state delay and location identification delay.

13. 摘要:使用子集构造法对非确定有限自动机进行确定化的过程中存在大量重复计算的问题。

Absrtact: the problem of repetitive computing exits in the process of transition from non-deterministic finite automata to deterministic finite automata using the subset construction method.

14. 研究弱可逆有限自动机的分解可以为分析有限自动机公开钥密码体制的安全性提供一种重要途径。

It is very important to investigate the decomposition of weakly invertible finite automata, since it could provide an approach to cryptanalyzing finite automata public-key cryptosystem(FAPKC).

15. 在语言理论,最简单的一类算法就是可以用有限自动机实理论可以算法现的算法,也是本书的主题。

In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this algorithm implement simplest book.

16. 有限自动机理论是一类简单类算法的数学理论,这些算法理论这些数学虽然简单但对计算机科学很重要。

The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science.

17. 运用有限自动机理论,针对多路视频信息处理量大的问题,提出了一种新的对数字图像信息加工处理方法。

In this paper, a new method is proposed of digital image information processing based on the principles of finite automation for the great amount of data in video information processing.

18. 在第二部分中,我们研究了较一般情形下前馈逆有限自动机的结构,并且讨论了弱可逆有限自动机的结构。

In the second part, we study the structure of feedforward inverse finite automata in general case, and we also discuss the structure of weakly invertible finite automata.

19. 为解决此问题,基于非确定有限自动机的特点并针对子集构造法的不足,提出了一种优化的非确定有限自动机确定化算法。

To solve this problem, an optimized algorithm for transition from NFA to DFA is put forward on the basis of characters of NFA and according to shortcomings of the subset. construction method.

20. 例如,XAUSTXML压缩器将DTD的模式信息转换成一组确定性有限自动机(DFA),每个DFA对应于DTD中的一个元素。

For example, the XAUST XML compressor converts the schema information of the DTD into a set of deterministic finite automata (DFA), one for each element in the DTD.

21. 从正则语言识别的角度证明了正则语言的识别系统确定有限自动机所识别的语言集是一个递归可枚举集,同时讨论了正则语言的可递归性。

The theorem that the language set distinguished deterministic finite automaton is a recursively enumerable set was proved, and then, the recursiveness of regular language was analyzed.

22. 简单介绍了多路自动机的定义,分析了多路自动机和有限自动机的关系,包括确定的有限自动机和非确定的有限自动机,并且给出了例子。

This paper introduces the defination of multiplicity automata and analyzes the relationship of multiplicity automata and deterministic automata or non_deterministic automata.

23. 该结构通过层次化有限自动机描述系统的控制行为;通过组件网络刻画系统的定时特性,为分析可重构控制器构形的变化提供了有效的手段。

In this architecture, the behavior is described by the HFSM, while the timing feature is described by network of components, which provides effective method to investigating reconfigurable CNC.

24. 如上个月所讨论的,我计划用确定性有限自动机(Deterministic Finite Automaton,DFA)来编译该代理。

As discussed last month, I plan to use Deterministic Finite Automaton (DFA) to compile the proxy.

25. “因他们的合著论文“有限自动机与其判定性问题”。”论文中引入了非确定自动机的概念,被证明是(计算理论科学研究中的)一个非常重要的概念。

For their joint paper "Finite Automata and their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept.

26. 文中首先通过在分子有限自动机上扩展一个分子下推存储器从而获得了一种简单的分子下推自动机,并基于该下推自动机提出了一类语言的分子自动机解法。

In this paper, a simple biomolecular pushdown automaton is constructed with a finite automaton and a pushdown store firstly, and an algorithm is designed to solve a kind of languages.

27. 本文提出了时序有限自动机,用它建立数据融合系统的形式化模型,并且给出了时序有限自动机模型的可达性分析方法,用于分析数据融合系统的性能和行为。

We extend finite automata with time sequence and define temporal finite automata, then we propose using temporal finite automat to build formal model for data fusion system.

28. 讲得更具体些,在上篇专栏文章中,我回顾了编译所谓“确定性有限自动机(Deterministic Finite Automaton,简称dfa)”的一些算法。

Most specifically, in the last column I reviewed algorithms to compile a so-called Deterministic Finite Automaton (DFA).

29. 在上一篇专栏文章中,我们编写了在所谓的“确定性有限自动机(Deterministic Finite Automaton或简称dfa)”中编译一组XPath的逻辑。

In the last column, we wrote the logic to compile a set of XPath in a so-called Deterministic Finite Automaton or DFA.

30. 在上一篇专栏文章中,我们编写了在所谓的“确定性有限自动机(Deterministic Finite Automaton或简称dfa)”中编译一组XPath的逻辑。

In the last column, we wrote the logic to compile a set of XPath in a so-called Deterministic Finite Automaton or DFA.

版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!