finite automata中文是什么意思

发音:

中文翻译
造句

有限时序机

finite adj. 有限的；【语法】限定的；【数学】有穷的，有尽的 ...
automata n. automaton 的复数。
asynchronous finite automata 异步有限自动机
deterministic finite automata 有穷自动机
deterministic finite state automata 确定性有限状态自动机
finite automata inference 有限自动机推断
finite counting automata 有限计算自动机
finite state automata 有限态自动机
finite-state automata 有限状态自动机
incomplete finite automata 不完全有限自动机
invertible finite automata 可逆有限自动机
one-way finite automata 单向有穷自动机
stochastic finite state automata 随机有限状态自动机
finite adj. 有限的；【语法】限定的；【数学】有穷的，有尽的。 n. 〔the finite〕有限(性)；〔集合词〕有限物。 adv. -ly ,-ness n.
abstract automata 抽象自动机
array automata 阵列自动机
automata automaton 的复数
automata causality 自动机因果律
automata classification 自动机分类
automata size 自动机规模
automata theory 有限自动机; 自动机理论
celuller automata 胞自计机
classification of automata 自动机分类
combination of automata 自动机组合
discrete automata 离散自动机

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

This task can be achieved by a finite automaton with just two states and a “ program ” consisting of four statements called transition rules
有限自动机在执行这项工作时，只需要两个状态和一套含四则转换规则的程序。
Although the adjacency matrix was a storage structure of finite automaton in common use , it was not proper to store all kinds of finite automata
摘要尽管邻接矩阵是有穷自动机的一种常用存储方法，但是，邻接矩阵并不适合存储所有类型的有穷自动机。
Based on this classification , some important types of fuzzy finite automaton are classified . in the meantime , the relations among these fuzzy finite automata in same models are obtained
同时，在新分类中，在同一类型中的各种原模糊有限自动机类型之间的等价或从属关系被证明和获得。
In chapter 2 , a class of fuzzy finite automata corresponding to the mealy type of ordinary automata is formulated and two types of statewise equivalence relations are introduced
在第二章中，对应于经典mealy型有限状态自动机的一类模糊有限状态自动机-新mealy型模糊有限状态自动机被建立。
Lastly , we obtain a key theorem which charactarize the link between computing with words via lattice - valued finite automata and computing with numbers via lattice - valued finite automata . 2 . lattice - valued regular grammar
最后,严格证明了一个刻画基于格值有限状态自动机的数值计算和基于格值有限状态自动机的词计算之间的联系的一个基本定理。
In chapter 1 , fuzzy finite automata is classified to two kind of basic models : one is the fuzzy finite automaton with initial states and no outputs , the other is the fuzzy finite automaton with outputs and no initial states
在第一章中，模糊有限自动机被划分为两种基本类型：一种是有初始状态，没有任何输出的一类模糊有限自动机；另一种是有输出，没有初始状态的一类模糊有限自动机。
Because the two - state finite automaton was too simple to be of any use in solving complex computational problems , we considered it nothing more than an interesting demonstration of the concept of programmable , autonomous biomolecular computers , and we decided to move on
由于双态有限自动机过于简单，无法解决任何复杂的计算问题，我们只是用它来验证程序化、自动化生物分子计算机观念可行而已。
Then we also formulate the model of computing with values via lattice - valued finite state automata , as well as the state transition function of the model of computing with words via lattice - valued finite state automata and the language accepted by lattice - valued finite automata
然后,给出了基于格值有限状态自动机的数值计算的形式模型。同时,建立了输入是词的格值有限状态自动机的转移函数以及格值有限状态自动机所接收的语言的定义。
From the equivalence relations , a minimal form is defined and a minimization algorithm of the mealy type of fuzzy finite automata is obtained . in chapter 3 , a fuzzy finite automata with a fuzzy initial state that was first considered by m . mizumoto , j . toyota and k . tanaka in 1969 is introduced . based on the mizumoto type of fuzzy finite automata , a statewise equivalence relation is considered
在第三章中，我们首先介绍了一类有模糊初始状态的模糊有限自动机- mizumoto型模糊有限自动机，然后定义了两种状态等价和两种模糊有限自动机等价的概念，接着证明了对于每一个mizumoto型模糊有限自动机，都存在一个与之等价的状态最小化模糊有限自动机，并且给出了一个状态最小化约简算法及其算法终止条件。
From the equivalence relation , a minimal form is defined and a minimization algorithm of the mizumoto type of fuzzy finite automata is obtained . in chapter 4 , quantum automata are introduced . we compare and contrast quantum automata with fuzzy finite automata , obtain some elementary relations and leave a set of open questions
在第四章中，首先了介绍量子自动机的概念，然后着重比较量子自动机与一种模糊有限自动机（即mizumoto型模糊有限自动机）之间的异同点，得到了量子自动机与模糊有限自动机关系的一些初步想法。