共查询到20条相似文献,搜索用时 78 毫秒
1.
2.
提出取值为格半群的Mealy格值有限自动机的概念,进而得到基于模糊字符串的Mealy格值有限自动机的扩张模型,并较详细讨论了其性质. 同时定义了扩张的完备Mealy格值有限自动机的行为矩阵, 在此基础上给出了其最小化算法. 相似文献
3.
本文研究了格值有限状态自动机(LFSA)的同态和强同态及其性质.利用强同态概念,在格值有限状态自动机的状态集上建立了一种等价关系,得到了格值有限状态自动机的商自动机,证明了商自动机与强同态像自动机同构. 相似文献
4.
本文给出了四类格值自动机及其语言的定义,证明了前三类格值自动机的等价性,讨论了第四类格值自动机与前三类格值自动机的关系。 相似文献
5.
6.
给出基于完全剩余格值逻辑上的不分明化环和理想(格上不分明化环和理想)两个概念。并进一步研究它们的一些基本代数性质。主要得到格上不分明化理想的交,和,积和商仍是格上不分明化理想。 相似文献
7.
本文先给出Fuzy半群中极小Fuzy理想的一些代数性质,进而利用极小Fuzy理想刻划Fuzzy单半群的一些代数性质 相似文献
8.
9.
由输入存贮线性有限自动机的线性系数组成的矩阵得出输入存贮线性有限自动机极小的等价定理,由此定理得出输入存贮线性有限自动机的极小化方法. 相似文献
10.
构造一种新型神经Mealy机,神经Mealy机具有一定的学习能力,它主要通过学习来获得(von Newman)计算机结构,可以较好地避免普通计算机那样损毁一条电路就带来灾难性后果的情况.其本质是将递归神经网络通过BP优化算法,对Mealy机进行模拟得到,并通过实验对该网络的学习性能进行研究分析.基于形式文法和自动机的等价性,用神经网络来实现文法推导.先采用神经网络对样本集进行学习,这些样本可由一个经典Mealy机生成,然后从训练完的神经网络提取出自动机. 相似文献
11.
In this paper we study fuzzy Turing machines with membership degrees in distributive lattices, which we called them lattice-valued fuzzy Turing machines. First we give several formulations of lattice-valued fuzzy Turing machines, including in particular deterministic and non-deterministic lattice-valued fuzzy Turing machines (l-DTMcs and l-NTMs). We then show that l-DTMcs and l-NTMs are not equivalent as the acceptors of fuzzy languages. This contrasts sharply with classical Turing machines. Second, we show that lattice-valued fuzzy Turing machines can recognize n-r.e. sets in the sense of Bedregal and Figueira, the super-computing power of fuzzy Turing machines is established in the lattice-setting. Third, we show that the truth-valued lattice being finite is a necessary and sufficient condition for the existence of a universal lattice-valued fuzzy Turing machine. For an infinite distributive lattice with a compact metric, we also show that a universal fuzzy Turing machine exists in an approximate sense. This means, for any prescribed accuracy, there is a universal machine that can simulate any lattice-valued fuzzy Turing machine on it with the given accuracy. Finally, we introduce the notions of lattice-valued fuzzy polynomial time-bounded computation (lP) and lattice-valued non-deterministic fuzzy polynomial time-bounded computation (lNP), and investigate their connections with P and NP. We claim that lattice-valued fuzzy Turing machines are more efficient than classical Turing machines. 相似文献
12.
13.
杨京开 《数学的实践与认识》2014,(3)
利用代数的方法研究了粗糙有限状态机的可恢复性与连通性,通过前驱与后继的关系,给出了粗糙有限状态机的可恢复性、连通性与可分离性的一些刻画,讨论了粗糙有限状态机的一些基本性质. 相似文献
14.
Lattice implication algebra is an algebraic structure that is established by combining lattice and implicative algebra. It originated from the study on lattice-valued logic. In this paper, we characterize two special classes of lattice implication algebra, namely, subdi-rectly irreducible and directly indecomposable lattice implication algebras. Some important results are obtained. 相似文献
15.
非结合剩余格是非结合格值逻辑系统的代数抽象,本文研究几类特殊非结合剩余格的代数性质。证明了满足预线性条件的非结合剩余格必是分配格,并给出预线性非结合剩余格的充分必要条件。同时,引入对合和强对合非结合剩余格的概念,研究了它们的基本性质,并分别给出对合和强对合非结合剩余格的等价条件。最后,通过反例说明强对合预线性非结合剩余格不一定是蕴涵格。 相似文献
16.
《International Journal of Approximate Reasoning》2014,55(3):797-811
During the last decades, a large amount of multi-valued transition systems, whose transitions or states are labeled with specific weights, have been proposed to analyze quantitative behaviors of reactive systems. To set up a unified framework to model and analyze systems with quantitative information, in this paper, we present an extension of doubly labeled transition systems in the framework of residuated lattices, which we will refer to as lattice-valued doubly labeled transition systems (LDLTSs). Our model can be specialized to fuzzy automata over complete residuated lattices, fuzzy transition systems, and multi-valued Kripke structures. In contrast to the traditional yes/no approach to similarity, we then introduce lattice-valued similarity between LDLTSs to measure the degree of closeness of two systems, which is a value from a residuated lattice. Further, we explore the properties of robustness and compositionality of the lattice-valued similarity. Finally, we extend the Hennessy–Milner logic to the residuate lattice-valued setting and show that the obtained logic is adequate and expressive with lattice-valued similarity. 相似文献
17.
盛莉 《纯粹数学与应用数学》2010,26(2):270-274
给出了格值上下文无关文法(LCFG),Chomsky范式文法,Greibach范式文法的定义.证明了对任意的LCFG存在与之等价的Chomsky范式文法;给出了对任意的LCFG,存在与之等价的Greibach范式文法的条件.文中结论表明了LCFG的特性与其取值格的代数性质密切相关. 相似文献
18.
19.
格蕴涵代数中的滤子是格值逻辑推理中的一类重要代数结构.本文给出了利用格蕴涵代数的蕴涵运算表找出格蕴涵代数中所有滤子的方法.并举例说明该方法的有效性、可行性. 相似文献
20.
The problem of finding a Turing machine with undecidable halting problem whose program contains the smallest number of instructions is well known. Obviously, such a machine must satisfy the following condition: by deleting even a single instruction from its program, we get a machine with decidable halting problem. In this paper, Turing machines with undecidable halting problem satisfying this condition are called connected. We obtain a number of general properties of such machines and deduce their simplest corollaries concerning the minimal machine with undecidable halting problem. 相似文献