This paper investigates function approximation on discrete input spaces by both neural networks and neural-fuzzy systems. Rather than use existing neural networks for function approximation on continuous input spaces, this paper proposes, based on a hierarchical systematic perspective, four simplified approximation schemes: simplified neural networks, extended simplified neural networks, simple...

Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68–92] have proved fundamental results that provide different equivalentways to represent fuzzy languageswithmembership values in a lattice-orderedmonoid, and generalize the well-known results of the classical theory of fo...

In the paper we develop the p-adic theory of discrete automata. Every automaton A (transducer) whose input/output alphabets consist of p symbols can be associated to a continuous (in fact, 1-Lipschitz) map from padic integers to p integers, the automaton function fA. The p-adic theory (in particular, the p-adic ergodic theory) turned out to be very efficient in a study of properties of automata...

In this paper, at first, we define the notion of general fuzzy automaton over a field; call vector (VGFA). Moreover, present concept max-min automaton. We show that if two VGFA are similar, they constitute an isomorphism. After that, prove isomorphism with threshold α, equivalent where $\alpha \in [0,1]$. Also, some examples given to clarify these new notions.

in a fuzzy metric space (x;m; *), where * is a continuous t-norm,a locally fuzzy contraction mapping is de ned. it is proved that any locally fuzzy contraction mapping is a global fuzzy contractive. also, if f satis es the locally fuzzy contractivity condition then it satis es the global fuzzy contrac-tivity condition.

This paper presents a string matching experience using deformed fuzzy automata for the recognition of imperfect strings. We propose an algorithm based on a deformed fuzzy automaton that calculates a similarity value between strings having a non-limited number of edition errors. Different selections of the fuzzy operators for computing the deformed fuzzy automaton transitions allows to obtain di...