Winfree proved that self - assembling tile systems in a plane are capable of doing universal computation , and when restricted to a line are exactly as powerful as discrete finite automa Winfree已经证明平面上的片装配系统能做通用的计算，而线性自装配模型的计算能力相当于离散的有限自动机。
This paper presents the resolving method of the best interaction strategy during cooperatin with the aid of fmit - state machine from the angle of game theory and the method is proved right and feasible in theory 本文从对策论角度出发，以有限自动机模型为工具，提出协作过程中的最优交互策略的求解并得到了理论证明。
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 由于双态有限自动机过于简单，无法解决任何复杂的计算问题，我们只是用它来验证程序化、自动化生物分子计算机观念可行而已。
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型模糊有限自动机，都存在一个与之等价的状态最小化模糊有限自动机，并且给出了一个状态最小化约简算法及其算法终止条件。
So a fast pattern matching algorithm on mass string assemble has been proposed to solve the problem of fuzzy matching between a string pattern and a string assemble . to make the algorithm cost - effective in space and time , we have developed an optimized trie - tree structure to store the string assemble and introduced the knuth - morris - pratt ( kmp ) and finite - automata ( fa ) string matching thought to our algorithm . the algorithm has been describled in details and the cost of space and run time has been analized in the thesis 为了实现汉字输入码的不完整输入，解决带有模糊输入符的字符串模式与一个字符串集合之间的匹配问题，论文在第三章提出一种海量字符串集合的模式匹配算法，给出了算法的具体实现和复杂度分析，并且提出一种优化的检索树结构来存储字符串集合以节省内存空间。为了提高算法的运行速度，算法还引入了kmp模式匹配和有限自动机匹配的思想。
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型模糊有限自动机）之间的异同点，得到了量子自动机与模糊有限自动机关系的一些初步想法。
In the compiled system , the paper describes symbolic structure of the siprom language word with regular expression . based on the fa theory , this paper presents a lexical analysis method by using morphology table . after comparing some common syntax analysis methods , this paper choosing the lr ( 1 ) analyzer 在编译部分，本文用正规表达式描述了siprom语言单词符号的结构，利用有限自动机原理，提出了用构造词形表的方式来识别单词的方法，使词法分析程序具有很好的开放性。
In this paper , first an overview and analysis is given of existing typical algorithms for real - time audio - stream segment then a algorithm base on energy is proposed to audio - stream segment . the utilization of message - action finite state automaton is also required to control different complex playback pattern 本文首先归纳和分析了当前语音检测的典型算法，通过综合比较，然后提出了一个基于能量的应用于教学系统的实时音频流分割的算法，首先对语音进行滤波除噪的预处理，然后利用语音的能量特征进行分割，最后利用有限自动机进行多模式控制。
In the research of spin arithmetic , we give the fam of basic spin - pp , and analyse the process of transfer data among the nodes . and we analyse the improved spin - bc arithmetic , and base on this , advances improved spin - bc + arithmetic . and analyse the spin arithmetic ’ s energy saving property is increased , and speediness is redused . by the simulate experiment , we get the synthesize appraise of spin , it is the arithmetic of using in node with the limited compute ability , area of wsn ’ s deploy is rectangle , speedinessless 在spin算法研究中,首先给出基本的spin - pp算法的有限自动机,并分析节点之间传输数据的过程;然后分析了改进的spin - bc算法,并在此基础上提出改进的spin - bc +算法。然后分析了spin的节能特性有很大提高,但快速性有很大降低,最后通过仿真实验,得到spin的综合评价,是一种适用于节点计算能力有限的,网络部署区域为长矩形,数据对时间不敏感一种平面路由协议。
