Intuitionistic fuzzy automata based on complete residuated lattice-valued logic

2012 ◽  
Vol 45 (1/2/3/4) ◽  
pp. 108 ◽  
Author(s):  
Qiansheng Zhang ◽  
Yirong Huang
Keyword(s):  
Residuated Lattice ◽  
Intuitionistic Fuzzy ◽  
Complete Residuated Lattice ◽  
Fuzzy Automata

Categories of Automata and Languages Based on a Complete Residuated Lattice

2018 ◽  
Vol 14 (03) ◽  
pp. 423-444 ◽  
Author(s):  
Vinay Gautam ◽  
S. P. Tiwari ◽  
Priyanka Pal ◽  
Jayanti Tripathi
Keyword(s):  
Residuated Lattice ◽  
Fuzzy Language ◽  
Fuzzy Automaton ◽  
Complete Residuated Lattice ◽  
Categorical Framework ◽  
Fuzzy Automata

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.

Fuzzy roughness of n-ary hypergroups based on a complete residuated lattice

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

l-Valued multiset automata and l-valued multiset languages

2020 ◽  
pp. 1-15
Author(s):  
Vinay Gautam
Keyword(s):  
Finite Automaton ◽  
Residuated Lattice ◽  
Regular Languages ◽  
Automata Theory ◽  
Necessary And Sufficient Condition ◽  
Zero Divisors ◽  
Complete Residuated Lattice ◽  
Pumping Lemma ◽  
Deterministic Formula ◽  
Necessary And Sufficient

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.

State hyperstructures of tree automata based on lattice-valued logic

2018 ◽  
Vol 52 (1) ◽  
pp. 23-42 ◽  
Author(s):  
Maryam Ghorani
Keyword(s):  
Residuated Lattice ◽  
Residuated Lattices ◽  
The Other ◽  
Equivalence Relations ◽  
Tree Automaton ◽  
Tree Automata ◽  
Other Hand ◽  
Complete Residuated Lattice ◽  
The Creation ◽  
The Given

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