scholarly journals Minimization of Hesitant L-Fuzzy Automaton

2021 ◽  
Author(s):  
Marzieh Shamsizadeh ◽  
Mohammad Mehdi Zahedi ◽  
Mohamad Javad Agheli Goki
Keyword(s):  
Time Complexity ◽  
Fuzzy Language ◽  
Fuzzy Automaton ◽  
Fuzzy Automata

Abstract In this paper, we study a new generalization for the notion of fuzzy automata, which we called hesitant L-fuzzy automaton (HLFA). We present the formulations of the mathematics framework for the theory of HLFA. Moreover, we present the concepts of hesitant L-fuzzy behavior and inverse hesitant L-fuzzy behavior recognized by a type of HLFA. After that, for any hesitant L-fuzzy language we present a minimal complete accessible deterministic hesitant L-fuzzy automaton recognizing that. Finally, we present an algorithm, which determines states of the minimal hesitant L-fuzzy automaton and we present the time complexity of the algorithm.

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.

scholarly journals Fuzzy Automata as Coalgebras

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 272
Author(s):  
Ai Liu ◽  
Shun Wang ◽  
Luis Soares Barbosa ◽  
Meng Sun
Keyword(s):  
Process Algebra ◽  
Handwriting Recognition ◽  
Point Of View ◽  
Air Conditioners ◽  
Object Oriented Design ◽  
Fuzzy Language ◽  
Different Types ◽  
Component Based Software Engineering ◽  
Fuzzy Automata

The coalgebraic method is of great significance to research in process algebra, modal logic, object-oriented design and component-based software engineering. In recent years, fuzzy control has been widely used in many fields, such as handwriting recognition and the control of robots or air conditioners. It is then an interesting topic to analyze the behavior of fuzzy automata from a coalgebraic point of view. This paper models different types of fuzzy automata as coalgebras with a monad structure capturing fuzzy behavior. Based on the coalgebraic models, we can define a notion of fuzzy language and consider several versions of bisimulation for fuzzy automata. A group of combinators is defined to compose fuzzy automata of two branches: state transition and output function. A case study illustrates the coalgebraic models proposed and their composition.

The Relationship Among Fuzzy Languages, Upper Sets and Fuzzy Ordered Monoids

2019 ◽  
Vol 15 (02) ◽  
pp. 361-372
Author(s):  
M. K. Dubey ◽  
S. P. Tiwari
Keyword(s):  
Ordered Monoid ◽  
Fuzzy Language ◽  
Fuzzy Automaton ◽  
The Relationship

The concept of recognizability of a fuzzy language by crisp deterministic fuzzy automaton and monoid is well known. The purpose of the present work is to study the recognizability of fuzzy languages by fuzzy ordered monoids. We show that the upper sets of a given fuzzy ordered monoid play a nice role in such studies. Also, we introduce the syntactic fuzzy ordered monoid of an upper set which recognizes this upper set.

scholarly journals On Algebraic Properties of Inverse Fuzzy Languages

2020 ◽  
pp. 59-66
Author(s):  
Pamy Sebastian ◽  
Varghese Jacob
Keyword(s):  
Inverse Monoid ◽  
Fuzzy Language ◽  
Fuzzy Automaton ◽  
Algebraic Properties

Aims/Objectives: In this paper, we investigate some of the algebraic properties of inverse fuzzy languages. We proved that a fuzzy automaton is inverse if and only if the transition monoid is an inverse monoid. A fuzzy language is an inverse fuzzy language if the minimal fuzzy automaton recognizing that fuzzy language is an inverse fuzzy automaton. We also discuss some more properties of an inverse fuzzy language based on the fact that an inverse monoid is one which is regular and idempotent commute.

scholarly journals Study of Weak Fuzzy Automaton Homomorphisms on Single Input Fuzzy Automata

2021 ◽  
pp. 408-413
Author(s):  
S. S. Dhure
Keyword(s):  
Fuzzy Automaton ◽  
Single Input ◽  
Fuzzy Automata

In this paper we have defined input-connected fuzzy automaton and established that in an input connected fuzzy automaton, element of an orbit maps to an element of the orbit under the weak fuzzy automaton endomorphism. Further, if an input x is unicore in the fuzzy automaton, then the number of weak fuzzy automaton endomorphisms of A(x) is equal to the number of states.

scholarly journals New directions in LB-valued general fuzzy automata: A topological view

Filomat ◽  
2021 ◽  
Vol 35 (1) ◽  
pp. 251-270
Author(s):  
Khadijeh Abolpour ◽  
Mohammad Zahedi
Keyword(s):  
Distributive Lattice ◽  
The State ◽  
Structure Space ◽  
Fuzzy Automaton ◽  
Approximation Operators ◽  
New Directions ◽  
Fuzzy Automata ◽  
General Fuzzy Automata

In the current study, we define the different L-valued operators on LB-valued general fuzzy automata or simply LB-valued GFA, where B is considered as a complete infinitely distributive lattice of propositions about the GFA. In particular, this study demonstrates that the L-valued successor and predecessor operators induce L-valued co-topologies while the L-valued residuated and approximation operators induce L-valued topologies on the state set of given LB-valued GFA. Further, we show that the continuity and separation properties of such LB-valued general fuzzy automaton can be examined in terms of these topologies. Moreover, we study and explicate the LB-valued GFA structure space and LB-valued GFA homotopy in more details.

Recognition of Birds in Blurred and Illumination Images by Local Features

2017 ◽  
Vol 7 (7) ◽  
pp. 243
Author(s):  
Suresha .M ◽  
. Sandeep
Keyword(s):  
Computer Vision ◽  
Time Complexity ◽  
Feature Detection ◽  
Feature Matching ◽  
Fast Algorithms ◽  
Local Features ◽  
Experimental Demonstration ◽  
Harris Corner ◽  
Blurred Image ◽  
Blurred Images

Local features are of great importance in computer vision. It performs feature detection and feature matching are two important tasks. In this paper concentrates on the problem of recognition of birds using local features. Investigation summarizes the local features SURF, FAST and HARRIS against blurred and illumination images. FAST and Harris corner algorithm have given less accuracy for blurred images. The SURF algorithm gives best result for blurred image because its identify strongest local features and time complexity is less and experimental demonstration shows that SURF algorithm is robust for blurred images and the FAST algorithms is suitable for images with illumination.

Sign in / Sign up

Export Citation Format

Share Document