We study fuzzy finite automata in which all fuzzy sets are defined by membership functions
whose codomain forms a lattice-ordered monoid L. For these L-fuzzy finite automata (L-FFA …

The use of Recurrent Neural Networks is not as extensive as Feedforward Neural Networks.
Training algorithms for Recurrent Neural Networks, based on the error gradient, are very …

This study aimed to examine deterministic FMFA, complete FMFA, and accessible FMFA,
using the definition of fuzzy multiset finite automaton (FMFA). We show that a fuzzy multiset …

In this paper, we map an arbitrary algebra to a completely distributive lattice and define
algebras of fuzzy sets. When the algebra is a term algebra, we obtain fuzzy tree languages …

The theory of fuzzy recognizable languages over bounded distributive lattices is presented
as a paradigm of recognizable formal power series. Due to the idempotency properties of …

The purpose of the present work is to construct a minimal deterministic fuzzy automaton and
to provide a minimal monoid representation for a given fuzzy language in a categorical …

In this note, first, we define bisimulation of type 2 for a basic logic general fuzzy automaton
and show that if there exists a bisimulation of type 2 between two basic logic general fuzzy …

A fuzzy tree language with membership grades in an arbitrary set is syntactically
recognizable (s-recognizable) if its syntactic algebra is finite. The equality problem for such …

The formulation of fuzzy automata allows us to select a great variety of triangular norms.
Depending on the selected triangular norm, a fuzzy automaton can accept a fuzzy language …

This study aims to investigate the algebraic properties of fuzzy multiset finite automaton
(FMFA), giving a congruence relation. Using the equivalence classes, a minimal accessible …