Based on previous work on encoding deterministic nite-state automata (DFAs) in discrete-time, second-order recurrent neural networks with sigmoidal discriminant functions, we propose an algorithm that constructs an augmented recurrent neural network that encodes fuzzy nite-state automata (FFAs). Given an arbitrary FFA, we apply an algorithm which transforms the FFA into an equivalent determinis...

In [1] the authors considered finitely-valued modal logics with Kripke style semantics where both propositions and the accessibility relation are valued over a finite residuated lattice. Unfortunately, the necessity operator does not satisfy in general the normality axiom (K). In this paper we focus on the case of finite chains, and we consider a different approach based on introducing a multim...

Bounded residuated lattice ordered monoids (R -monoids) are a common generalization of pseudo-BL-algebras and Heyting algebras, i.e. algebras of the non-commutative basic fuzzy logic (and consequently of the basic fuzzy logic, the Łukasiewicz logic and the non-commutative Łukasiewicz logic) and the intuitionistic logic, respectively. In the paper we introduce and study classes of filters of bou...

Satellite image classification is a significant technique used in remote sensing for the computerized study and pattern recognition of satellite information, which make possible the routine explanation of a huge quantity of information. Nowadays cellular automata are implemented for simulation of satellite images and also cellular automata relates to categorization in satellite image is used si...

We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...

An algebra M = (M ; ,∨,∧,→, 0, 1) of type 〈2, 2, 2, 2, 0, 0〉 is called a bounded commutative R`-monoid iff (i) (M ; , 1) is a commutative monoid, (ii) (M ;∨,∧, 0, 1) is a bounded lattice, and (iii) x y ≤ z ⇐⇒ x ≤ y → z, (iv) x (x → y) = x ∧ y, for each x, y, z ∈ M . In the sequel, by an R`-monoid we will mean a bounded commutative R`-monoid. (Note that bounded commutative R`-monoids are just bo...

Taking intuitionistic fuzzy sets as the structures of truth values, we propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs, for short) and pushdown automata with final states (IFPDAs). Then we investigate algebraic characterization of intuitionistic fuzzy recognizable languages including decomposition form and representation theorem. By introducing the generalized subset c...

This material is studying MV-algebras and BL-algebras in terms of applicability in Boole algebra. Boole algebras are expanded use in fuzzy logic.