最大乘积型Fuzzy上下无关文法与下推自动机

在文献[1]的基础上,讨论了最大乘积型Fuzzy上下文无关文法与最大乘积型Fuzzy下推自动机的关系,即:由给定的最大乘积型Fuzzy上下文无关文法可构造一个最大乘积型Fuzzy下推自动机使得二者接受的语言集相同,反之亦然。从而达到自动识别语言的目的。     

乘积λ—可加Fuzzy测度和Fuzzy核

本文首先给出乘积λ－可加Ｆｕｚｚｙ测度的两种等价定义，在此基础上建立了乘积空间上的Ｆｕｂｉｎｉ定理，其次提出了Ｆｕｚｚｙ核的概念，并由Ｆｕｚｚｙ核引出乘积空间上另一类λ－可加Ｆｕｚｚｙ测度。     

Fuzzy值Fuzzy测度的和与乘积的零可加与自连续性

本文讨论了Ｆｕｚｚｙδ－代数上的Ｆｕｚｚｙ值Ｆｕｚｚｙ测度的和与乘积的零可加、自连续性。     

乘积λ─可加Fuzzy测度和Fuzzy核

本文首先给出乘积λ─可加Ｆｕｚｚｙ测度的两种等价定义，在此基础上建立了乘积空间上的Ｆｕｂｉｎｉ定理，其次提出了Ｆｕｚｚｙ核的概念，并由Ｆｕｚｚｙ核引出乘积空间上另一类λ─可加Ｆｕｚｚｙ测度．     

Fuzzy映射和乘积Fuzzy测度

从研究Ｆｕｚｚｙ集合的直积和Ｆｕｚｚｙ关系出发,讨论了Ｆｕｚｚｙ关系和Ｆｕｚｚｙ映射的一些性质,最后利用Ｆｕｚｚｙ关系的截影性质给出了乘积Ｈ型Ｆｕｚｚｙ测度的存在性定理。     

基于模糊乘积有限自动机的覆盖关系

对Mealy-型模糊有限自动机乘积结构作了进一步的研究,并且对覆盖关系作了细致的刻画,推广了原有的覆盖概念.针对Mealy-型这类模糊有限自动机,通过性质考察了此覆盖概念的合理有效性,新的覆盖概念在乘积自动机间建立了更多的联系.特别证明了直积、级联积、圈积三种乘积之间的覆盖关系.得到了一些乘积自动机覆盖关系的传递性质.     

具有Fuzzy概率的Fuzzy可靠性问题的求解途径

本文提出了工程实践中常见的清晰事件－Ｆｕｚｚｙ概率的Ｆｕｚｚｙ可靠性分析问题的求解途径，首先讨论了Ｆｕｚｚｙ数的代数运算法则，然后在此基础上将Ｆｕｚｚｙ可靠性求解问题转换为Ｆｕｚｚｙ数的运算问题，从而使这类Ｆｕｚｚｙ可靠性分析问题在理论上得到解决，本文还给出了一个算例。     

Fuzzy子格与Fuzzy同态

每个代数结构一般都可引入相应的Ｆｕｚｚｙ子结构，为了进一步研究Ｆｕｚｚｙ子和以及Ｆｕｚｚｙ同态的各种性质，本文引入了亚格的概念，并建立了Ｆｕｚｚｙ子格与亚格的对应关系（定理１．７）；给出了Ｆｕｚｚｙ同态（同构）的分解定理（定理２．５和推论２．７）；最后讨论了同余关系商格的Ｆｕｚｚｙ子格问题，证明了在自然映射下，任一保序映射可以引导出商格中应的Ｆｕｚｚｙ子格，并由此引出了φ－Ｆｕｚｚｙ商子格的概念。     

格的Fuzzy同余理想

文「１」提出了格的Ｆｕｚｚｙ理想，Ｆｕｚｚｙ同余关系等概念并对其性质进行了探讨。本文在此基础上提出了格的Ｆｕｚｚｙ同余理想的概念并分别讨论了格，Ｆｕｚｚｙ商格及格直积的Ｆｕｚｚｙ同余理想，得到了一些初步结果。     

Fuzzy映射与F基数

本文定义了从一个Ｆｕｚｚｙ集到另外一个Ｆｕｚｚｙ集的映射，称之为Ｆｕｚｚｙ映射，它不同于以往人们习惯用的“模糊映射”；给出了Ｆｕｚｚｙ映射的等价条件并研究了Ｆｕｚｚｙ映射的性质；基于这样的Ｆｕｚｚｙ映射定义了Ｆｕｚｚｙ映集的基数简称为Ｆ基数，讨论了它的基本性质；最后说明了Ｆ基数对于连续统假设的影响。     

Bipolar fuzzy relation equations systems based on the product t‐norm

Bipolar fuzzy relation equations arise as a generalization of fuzzy relation equations considering unknown variables together with their logical connective negations. The occurrence of a variable and the occurrence of its negation simultaneously can give very useful information for certain frameworks where the human reasoning plays a key role. Hence, the resolution of bipolar fuzzy relation equations systems is a research topic of great interest. This paper focuses on the study of bipolar fuzzy relation equations systems based on the max‐product t‐norm composition. Specifically, the solvability and the algebraic structure of the set of solutions of these bipolar equations systems will be studied, including the case in which such systems are composed of equations whose independent term be equal to 0. As a consequence, this paper complements the contribution carried out by the authors on the solvability of bipolar max‐product fuzzy relation equations.     

The Constructions of the Max-min Fuzzy Relation Equations That Have a Unique Minimal Solution

ＴｈｅＣｏｎｓｔｒｕｃｔｉｏｎｓｏｆｔｈｅＭａｘｍｉｎＦｕｚｙＲｅｌａｔｉｏｎＥｑｕａｔｉｏｎｓＴｈａｔＨａｖｅａＵｎｉｑｕｅＭｉｎｉｍａｌＳｏｌｕｔｉｏｎＬｉＪｉａｎｘｉｎＨｕＧａｎｇ（ＴｅａｃｈｉｎｇａｎｄＲｅｓｅａｒｃｈＳｅｃｔｉｏｎｏｆＭ...     

关于(QU)型模糊拓扑群的直积

研究(QU)型模糊拓扑群族直积,证明了任意(QU)型模糊拓扑群族的直积仍是(QU)型模糊拓扑群;研究了(QU)型模糊拓扑群族直积的模糊单位元之重域基的结构,得到了(QU)型模糊拓扑群族直积的一些重要性质.     

Approximate String Matching Using Deformed Fuzzy Automata: A Learning Experience

Deformed fuzzy automata are complex structures that can be used for solving approximate string matching problems when input strings are composed by fuzzy symbols. Different string similarity definitions are obtained by the appropriate selection of fuzzy operators and parameters involved in the calculus of the automaton transitions. In this paper, we apply a genetic algorithm to adjust the automaton parameters for selecting the ones best fit to a particular application. This genetic approach overcomes the difficulty of using common optimizing techniques like gradient descent, due to the presence of non-derivable functions in the calculus of the automaton transitions. Experimental results, obtained in a text recognition experience, validate the proposed methodology.     

Fuzzy local ω-systems

The natural language computing today demands for the study of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, the concept of fuzzy local ω-language, Büchi fuzzy local ω-language, and some closure properties of fuzzy local ω-languages are presented. We introduce deterministic fuzzy finite automaton with different acceptance mode on fuzzy ω-languages and establish the relationship between these various classes of fuzzy ω-languages. We have defined deterministic fuzzy local automaton and also establish relationships between deterministic fuzzy local automaton, fuzzy local ω-language and Büchi fuzzy local ω-language. Further we show that every fuzzy regular ω-language is a projection of a Büchi fuzzy local ω-language.     

A parametric total order on fuzzy numbers and a fuzzy shortest route problem

A parametric total order relation is introduced in the form of a certain modification of the "fuzzy max" order on the class of fuzzy numbers generated by a shape function. By the parametric relation. fuzzy numbers unordered with respect of the fuzzy max order can be ordered according either to their value of center or the size of ambiguity. A fuzzy shortest route problem in which are distances are given by fuzzy numbers is discussed under the criterion of the parametric total order, and solved by the dynamic programming approach. A method is proposed to find all of fuzzy routes mimmal in the sense of the fuzzy max order.     

模糊乘积的“失效”与“失真”的一个判定

给出模糊乘积"失真"的充要条件,并讨论模糊乘积的"失效"与"失真"的关系.     

模糊乘积的"失效"与"失真"的一个判定

给出模糊乘积"失真"的充要条件,并讨论模糊乘积的"失效"与"失真"的关系.     

直积群上几类直觉模糊子群及其投影

给出了直觉模糊子群的性质及其等价命题,并通过定义直觉模糊集的直积与投影,获得了直觉模糊直积群及直觉模糊投影子群,进而在直觉模糊标准子群的条件下,分别讨论了直积群上的直觉模糊正规子群、直觉模糊特征子群、直觉模糊共轭与其直觉模糊投影子群的关系.     

直觉模糊变换半群的积与覆盖关系

提出了直觉模糊变换半群的(全)直积,圈积,直觉模糊变换半群的覆盖的定义,利用代数的手段讨论了直觉模糊变换半群的积的结合性质,研究了直觉模糊变换半群的积的覆盖关系.