This paper investigates the application of the computational model of Cellular Automata (CA) for pattern classification of real valued data. A special class of CA referred to as Fuzzy CA (FCA) is employed to design the pattern classifier. It is a natural extension of conventional CA, which operates on binary string employing boolean logic as next state function of a cell. By contrast, FCA emplo...

Some uniform categorical theoretical treatment of automata and lattice-valued fuzzy automata using quantale theory is studied in this paper. First, L-relational sheaves on a monoidM andQ-enriched categories are introduced for quantales L andQ, the equivalence of the corresponding categories are proved next. Then lattice-valued (fuzzy) automata are described by Q-enriched categories. In fact, la...

We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in the LogicGuard project [15, 16]. We investigate closure properties of the class of MK-fuzzy languages accepted by MK-fuzzy automata as well as by their deterministic counterp...

State minimization is a fundamental problem in automata theory. The problem is also of great importance in the study of fuzzy automata. However, most work in the literature considered only state reduction of fuzzy automata, whereas the state minimization problem is almost untouched for fuzzy automata. Thus in this paper we focus on the latter problem. Formally, the decision version of the minim...

This work is towards the study of the relationship between fuzzy preordered sets and Alexandrov (left/right) fuzzy topologies based on generalized residuated lattices here the fuzzy sets are equipped with generalized residuated lattice in which the commutative property doesn't hold. Further, the obtained results are used in the study of fuzzy automata theory.

State reduction of fuzzy automata has been studied by many authors. All of them have dealt with classical fuzzy automata over the Gödel structure and reduction has been done using crisp equivalence relations. In [2, 3, 7] we have made several innovations. We have studied fuzzy automata over a more general structure of truth values, over a complete residuated lattice, we have shown that better r...