automata theory

automata theory的基本解释

-

自动化理论, 自动机理论

与automata theory相关的网络例句 [注：此内容来源于网络，仅供参考]

At the same time , we discuss the determinism and nondeterminism of formula-clock automata and the closure propertied under Boolean operation of the language which is accepted by formula-clock automata. We also prove the expressive equivalence between the deterministic formula-clock automata and the nondeterministic formula-clock automata. This means that every nondeterministic formula-clock automata can be transformed to a deterministic formula-clock automata which exactly accept the timed language identified by the fomer.We also extend timed words to infiniteness and define the formula-clock Buchi automata and the formula-clock Muller automata. At last, we show its application in formal verification and modeling of real-time system.

然后讨论了公式时钟自动机的确定性和非确定性，公式时钟自动机识别的语言类在并、交、补运算下的封闭性；并证明了确定的公式时钟自动机和非确定的公式时钟自动机表达能力的等价性，这意味这每一个非确定的公式时钟自动机都能转换为一个与之识别相同时间语言的确定的公式时钟自动机；我们将时间字扩展为无穷的，从而定义了公式时钟Buchi自动机与公式时钟Muller自动机；最后给出了用它进行实时系统的形式化验证方面及对实时系统建模的应用。

Secondly, in a more generalized framestructrue--lattice-ordered monoids,the notion of lattice-valued Mealy-type automata is introduced,we traverse some algebraic properties of this automata and investigate the congruences and homomorphisms of this type automata.Our main results indicate that the algebraic properties of lattice-valued Mealy-type automata have Close links to the algebraic properties of lattice-ordered monoids which automata take values in.Futhermore we study the minimization of lattice-valued Mealy-type automata and provide an algorithm to achieve the minimal lattice-valued Mealy-type automata within finite steps.

其次，在更一般的框架—格半群意义下，提出具有输入和输出字符的自动机——格值Mealy自动机的概念，从代数角度出发较详细地研究了此类自动机具有的性质，同时研究了此类自动机的同余和同态，揭示了此类自动机的代数性质和格半群的紧密联系，最终研究了格值Mealy自动机的极小化问题，并给出了在有限步可实现此极小化的算法。

Then we found bijections between quadratic form finite automata and input memory linear automata which lead to a way to produce all weakly invertible or weak inverse quadratic form finite automata. In the last section of chapter three, we extend these results to a more general class of nonlinear finite automata (called qusi-quadratic form finite automata).

然后我们建立了建立全体二次型有限自动机与全体输入存储线性有限自动机之间的的一个一一对应L，由于L保持弱逆性（3.20定理），由此我们得到了产生全体可逆二次型有限自动机的方法：要产生一个具有某种可逆性的二次型有限自动机只需产生一个具有同种可逆性的输入存储线性有限自动机，然后作其二次型提升即可。

与automata theory相关的网络解释 [注：此内容来源于网络，仅供参考]

finite-state automata：有穷状态自动机

元胞自动机理论:Cellular Automata theory | 有穷状态自动机:Finite State Automata | 模糊元胞自动机:Fuzzy cellular automata

theory of cardinals：基数论

theory of automata 自动机理论 | theory of cardinals 基数论 | theory of complex multiplication 复数乘法论

theory of automata：自动机理论

theoretical model 理论模型 | theory of automata 自动机理论 | theory of cardinals 基数论