Fuzzy Galois connections on Alexandrov L-topologies

In this paper, we introduce the notion of Galois and dual Galois connections as a topological viewpoint of concept lattices in a complete residuated lattice. Under various relations, we investigate the Galois and dual Galois connections on Alexandrov L-topologies. Moreover, their properties and examples are investigated.

The categorical relationships between neighborhood spaces, ┬-neighborhood spaces and stratified L-neighborhood spaces

In this paper, for a complete residuated lattice L, we present the categorical properties of ?-neighborhood spaces and their categorical relationships to neighborhood spaces and stratified L-neighborhood spaces. The main results are: (1) the category of ?-neighborhood spaces is a topological category; (2) neighborhood spaces can be embedded in ?-neighborhood spaces as a reflective subcategory, and when L is a meet-continuous complete residuated lattice, ?-neighborhood spaces can be embedded in stratified L-neighborhood spaces as a reflective subcategory; (3) when L is a continuous complete residuated lattice, neighborhood spaces (resp., ?-neighborhood spaces) can be embedded in ?-neighborhood spaces (resp., stratified L-neighborhood spaces) as a simultaneously reflective and coreflective subcategory.

l-Valued multiset automata and l-valued multiset languages

The reason for this work is to present and study deterministic multiset automata, multiset automata and their languages with membership values in complete residuated lattice without zero divisors. We build up the comparability of deterministic [Formula: see text]-valued multiset finite automaton and [Formula: see text]-valued multiset finite automaton in sense of recognizability of a [Formula: see text]-valued multiset language. Then, we relate multiset regular languages to a given [Formula: see text]-valued multiset regular languages and vice versa. At last, we present the concept of pumping lemma for [Formula: see text]-valued multiset automata theory, which we utilize to give a necessary and sufficient condition for a [Formula: see text]-valued multiset language to be non-constant.

Fuzzy Regular Languages Based on Residuated Lattice

The purpose of this work is to introduce the concept of fuzzy regular languages (FRL) accepted by fuzzy finite automata, and try to introduce the categorical look of fuzzy languages where the codomain of membership functions are taken as a complete residuated lattice, instead of [Formula: see text]. Also, we have introduced pumping lemma for FRL, which is used to establish a necessary and sufficient condition for a given fuzzy languages to be non-constant.

The Relations between Residuated Frames and Residuated Connections

We introduce the notion of (dual) residuated frames as a viewpoint of relational semantics for a fuzzy logic. We investigate the relations between (dual) residuated frames and (dual) residuated connections as a topological viewpoint of fuzzy rough sets in a complete residuated lattice. As a result, we show that the Alexandrov topology induced by fuzzy posets is a fuzzy complete lattice with residuated connections. From this result, we obtain fuzzy rough sets on the Alexandrov topology. Moreover, as a generalization of the Dedekind–MacNeille completion, we introduce R-R (resp. D R - D R ) embedding maps and R-R (resp. D R - D R ) frame embedding maps.

A Residuated Lattice of L-Fuzzy Subalgebras of a Mono-Unary Algebra

Given a complete residuated lattice [Formula: see text] and a mono-unary algebra [Formula: see text], it is well known that [Formula: see text] and the residuated lattice [Formula: see text] of [Formula: see text]-fuzzy subsets of [Formula: see text] satisfy the same residuated lattice identities. In this paper, we show that [Formula: see text] and the residuated lattice [Formula: see text] of [Formula: see text]-fuzzy subalgebras of [Formula: see text] satisfy the same residuated lattice identities if and only if the Heyting algebra [Formula: see text] of subuniverses of [Formula: see text] is a Boolean algebra. We also show that [Formula: see text] is a Boolean algebra (respectively, an [Formula: see text]-algebra) if and only if [Formula: see text] is a Boolean algebra (respectively, an [Formula: see text]-algebra) and [Formula: see text] is a Boolean algebra.

Categories of Automata and Languages Based on a Complete Residuated Lattice

The purpose of this paper is to introduce a new category of fuzzy automata based on complete residuated lattice. We introduce and study the categorical concepts such as product, equalizer and their duals in this category. Finally, we establish a construction of a minimal fuzzy automaton for a given fuzzy language in a categorical framework. The construction of such fuzzy automaton is based on derivative of a given fuzzy language.