格值Moore机的最小化

提出格值Moore机的概念,从代数角度出发详细研究此类自动机的性质,同时研究此类自动机的同余和同态,揭示此类自动机的代数性质和取值格半群的紧密联系,最终研究格值Moore机的极小化,给出可在有限步实现极小化的算法,并从理论上证明了得到的最小化格值Moore机与原格值Moore机等价。     

基于模糊字符串的Mealy格值有限自动机及其最小化

提出取值为格半群的Mealy格值有限自动机的概念,进而得到基于模糊字符串的Mealy格值有限自动机的扩张模型,并较详细讨论了其性质. 同时定义了扩张的完备Mealy格值有限自动机的行为矩阵, 在此基础上给出了其最小化算法.     

基于格半群的有限状态自动机的同态

本文研究了格值有限状态自动机(LFSA)的同态和强同态及其性质.利用强同态概念,在格值有限状态自动机的状态集上建立了一种等价关系,得到了格值有限状态自动机的商自动机,证明了商自动机与强同态像自动机同构.     

模糊树自动机的同余与同态

从代数角度出发研究模糊树自动机的同余与同态,得出模糊树自动机的同态基本定理和同构基本定理,且对模糊树自动机的语言及模糊树自动机的极小化问题进行研究.     

格值有限自动机的乘积

初步建立了格值有限自动机的乘积理论.引入了格值变换半群,研究了格值有限自动机在各种乘积情形下的转移函数性质,讨论了各种乘积之间的覆盖关系,为进一步研究量子自动机的乘积理论奠定基础.     

循环模糊有限自动机的同态性质

讨论了模糊有限自动机(即模糊Mealy机)的同态性质和循环模糊有限自动机的同态性质,证明了每个模糊有限自动机都是有限个循环模糊有限自动机的直和的同态象。     

格值代数系统的解分析

引入了格值形式幂级数的概念并建立其运算法则,给出格值形式幂级数特有的性质。重点研究代数系统在格序幺半群下的解的存在性与唯一性问题。扩充定义了V-proper格值代数系统,给出其解的袁达式,研究其与proper格值代数系统的关系,并与定义在自然数半环上的代数系统进行比较,最后得出结论:proper和V-proper格值代数系统都存在唯一强解。体现出格值代数系统具有更好的性质。     

效应代数的不分明化滤子

在连续格值逻辑的语义框架下,以Lukasiewicz蕴涵算子为工具定义了连续格值逻辑上的效应代数之不分明化滤子的概念,将用G.Cantor集合理论所刻画的效应代数的滤子概念在连续格值谓词演算下给予重新刻画,给出了不分明滤子的几个等价描述和性质.在两个经典效应代数的效应态射与效应同构意义下,讨论了这种不分明滤子的像和前像问题.     

几类格值自动机的关系

本文给出了四类格值自动机及其语言的定义,证明了前三类格值自动机的等价性,讨论了第四类格值自动机与前三类格值自动机的关系。     

基于L*-格值逻辑上的BCH-代数中的直觉不分明化理想

在L*-格值逻辑的语义框架下,以L*-格值上的Lukasiewicz蕴涵算子为工具定义了L*-格值逻辑上的直觉不分明化BCH-代数的概念,将用集论所刻画的BCH-代数与理想的概念在L*-格值谓词演算下给予了新的刻画,讨论了直觉不分明化BCH-代数中的理想、闭理想及q理想的有关性质.     

Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency

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.     

模糊有限状态机的一些性质

讨论模糊有限状态机的一些代数性质,得到模糊有限状态机在同态作用下子系统(强子系统)的前像仍是子系统(强子系统),证明若两个模糊有限状态机之间存在满足一定条件的同态映射时,前一个模糊有限状态机是强连通的(循环的),则后一个模糊有限状态机也是强连通的(循环的),且若这个同态是强满同态,则其中一个模糊有限状态机是完全的当且仅当另一个模糊有限状态机是完全的。对模糊有限状态机的积与原来的模糊有限状态机的完全性、强连通性、循环性、交换性等关系也进行讨论,得到一些结果。     

粗糙有限状态机的可恢复性与连通性

利用代数的方法研究了粗糙有限状态机的可恢复性与连通性,通过前驱与后继的关系,给出了粗糙有限状态机的可恢复性、连通性与可分离性的一些刻画,讨论了粗糙有限状态机的一些基本性质.     

Subdirectly Irreducible and Directly Indecomposable Lattice Implication Algebras

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.     

预线性与对合非结合剩余格

非结合剩余格是非结合格值逻辑系统的代数抽象,本文研究几类特殊非结合剩余格的代数性质。证明了满足预线性条件的非结合剩余格必是分配格,并给出预线性非结合剩余格的充分必要条件。同时,引入对合和强对合非结合剩余格的概念,研究了它们的基本性质,并分别给出对合和强对合非结合剩余格的等价条件。最后,通过反例说明强对合预线性非结合剩余格不一定是蕴涵格。     

Simulation for lattice-valued doubly labeled transition systems

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.     

格值上下文无关文法的范式

给出了格值上下文无关文法（LCFG）,Chomsky范式文法,Greibach范式文法的定义.证明了对任意的LCFG存在与之等价的Chomsky范式文法;给出了对任意的LCFG,存在与之等价的Greibach范式文法的条件.文中结论表明了LCFG的特性与其取值格的代数性质密切相关.     

逆序(L)集合范畴的格值函数空间及其性质

引入逆序(L)集合范畴概念,并研究该范畴中两种函数空间结构表示,即格值函数空间与伪格值函数空间,进一步指出在逆序(L)集合范畴中格值函数空间函子与格值积函子互为伴随及伪格值函数空间函子与格值交函子也互为伴随,从而逆序(L)集合范畴为Cartesian闭范畴.     

利用格蕴涵代数找出所有滤子的算法

格蕴涵代数中的滤子是格值逻辑推理中的一类重要代数结构．本文给出了利用格蕴涵代数的蕴涵运算表找出格蕴涵代数中所有滤子的方法．并举例说明该方法的有效性、可行性．     

Turing Machines Connected to the Undecidability of the Halting Problem

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.