Results 241 to 250 of about 88,591 (284)
Some of the next articles are maybe not open access.
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
2006
This paper just tries to stimulate some reflection to extend the current theories of fuzzy sets to wider areas of language, with the objective of reaching a better knowledge of the links between language and its representation by means of fuzzy sets, when possible.
Enric Trillas +2 more
openaire +1 more source
This paper just tries to stimulate some reflection to extend the current theories of fuzzy sets to wider areas of language, with the objective of reaching a better knowledge of the links between language and its representation by means of fuzzy sets, when possible.
Enric Trillas +2 more
openaire +1 more source
On the recognizability of fuzzy languages II
Fuzzy Sets and Systems, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bozapalidis, Symeon +1 more
openaire +2 more sources
An elementary fuzzy programming language
Fuzzy Sets and Systems, 1993In this paper, we define a fuzzy imperative programming language (called L), powerful enough to express crisp and fuzzy algorithms. Its small instruction set is designed to enhance readability, and it is proved before that the class of functions that can be programmed in L is equivalent to the class of functions computed by a W-Turing machine and to ...
Rafael Morales-Bueno +3 more
openaire +1 more source
Topological characterization for fuzzy regular languages
2018Summary: We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (profinite space), and then we give a representation of closed fuzzy subsets in ...
Wang, Yongbing, Li, Yongming
openaire +2 more sources
A fuzzy database-query language
Information Systems, 1990Abstract Selection conditions for conventional database-query languages are not natural enough to express criteria with fuzzy concepts. To choose some alternatives from a database requires the techniques of multicriteria decision making or conflict resolution.
M.H. Wong, K.S. Leung
openaire +1 more source
A fuzzy relational inference language
Fuzzy Sets and Systems, 1984The paper is concerned with the description of basic schemes and properties of a projected fuzzy relational inference language named FRIL. The language is intended to be a high level automatic inference knowledge base system similar to the language PROLOG. FRIL is based upon the mathematics of relations instead of predicate calculus and incorporating a
Baldwin, J. F., Zhou, S. Q.
openaire +2 more sources