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

Filomat ◽  
2021 ◽  
Vol 35 (4) ◽  
pp. 1267-1287
Author(s):  
Lingqiang Li ◽  
Qiu Jin ◽  
Chunxin Bo ◽  
Zhenyu Xiu

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.

2010 ◽  
Vol 20 (1) ◽  
pp. 41-57 ◽  
Author(s):  
Yunqiang Yin ◽  
Jianming Zhan ◽  
P. Corsini

Author(s):  
Vinay Gautam

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.


2018 ◽  
Vol 52 (1) ◽  
pp. 23-42 ◽  
Author(s):  
Maryam Ghorani

In this paper, an association is organized between the theory of tree automata on one hand and the hyperstructures on the other hand, over complete residuated lattices. To this end, the concept of order of the states of a complete residuated lattice-valued tree automaton (simply L-valued tree automaton) is introduced along with several equivalence relations in the set of the states of an L-valued tree automaton. We obtain two main results from this study: one of the relations can lead to the creation of Kleene’s theorem for L-valued tree automata, and the other one leads to the creation of a minimal v-valued tree automaton that accepts the same language as the given one.


Sign in / Sign up

Export Citation Format

Share Document