Results 241 to 250 of about 226,848 (292)
Some of the next articles are maybe not open access.
Fuzzy tree language recognizability
Fuzzy Sets and Systems, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bozapalidis, Symeon +1 more
openaire +1 more source
Fuzzy Sets and Systems, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Two dimensional fuzzy regular languages
Fuzzy Sets and Systems, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. John Kaspar +3 more
openaire +1 more source
FUZZY LOGIC, FUZZY SETS, AND NATURAL LANGUAGES
International Journal of General Systems, 1991This is an overview paper presenting the main results obtained by the author and his colleagues in the field of fuzzy logic and modelling of natural language semantics and is composed of an introduction followed by two main parts. Section 2 discusses our results in terms of fuzzy logic, namely that of prepositional and first-order fuzzy logic based on ...
openaire +1 more source
Information Sciences, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Malik, D. S. +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Malik, D. S. +2 more
openaire +2 more sources
Fuzzy grammars and recursively enumerable fuzzy languages
Information Sciences, 1992A fuzzy language ( \(L\)-language) is treated as an \(L\)-subset of \(A^*\) with \(A^*\) being a free monoid of an alphabet defined over a finite set \(A\). The main result of the paper states that if \(L\) is finite then an \(L\)-language is generated by an \(L\)-grammar if and only if it is a recursively enumerable \(L\)-subset.
openaire +2 more sources
Fuzzy Models of First Order Languages
Mathematical Logic Quarterly, 1986The concepts of generalized algebra and realization introduced by \textit{H. Rasiowa} and \textit{R. Sikorski} [The mathematics of metamathematics (1963; Zbl 0122.243)] are utilized to propose a general foundation of fuzzy set theory. The fuzzy models of a first order language are treated in a suitable categorial setting.
DI NOLA, Antonio, GERLA, Giangiacomo
openaire +2 more sources
1977
The present paper deals with cut-point languages accepted by R-fuzzy automata whose coefficients of the initial and final vectors and each transition matrix are elements of a partially ordered semiring R. To formulate algebraically the problems we are concerned with a mapping A from the class P0S of all partially ordered semirings into the class of all
openaire +1 more source
The present paper deals with cut-point languages accepted by R-fuzzy automata whose coefficients of the initial and final vectors and each transition matrix are elements of a partially ordered semiring R. To formulate algebraically the problems we are concerned with a mapping A from the class P0S of all partially ordered semirings into the class of all
openaire +1 more source
Deterministic Acceptors of Regular Fuzzy Languages
IEEE Transactions on Systems, Man, and Cybernetics, 1974The one-to-one relationship between finite automata, regular (type-3) languages, and regular expressions is well known. This correspondence demonstrates the use of regular expressions for describing deterministically finite fuzzy automata and regular fuzzy languages, and introduces a normal form for the production of a regular fuzzy grammar when the ...
Thomason, Michael G., Marinos, Peter N.
openaire +2 more sources