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...

We give a new version of fuzzy alternating Büchi automata over distributive lattices: weights are putting in every leaf node of run trees rather than along with edges from every node to its children. Such settings are great benefit to obtain complement just by taking dual operation and replacing each final weight with its complement. We prove that L-fuzzy nondeterministic Büchi automata have th...

Fuzzy languages and fuzzy automata are considered using techniques from algebraic theory of automata. Syntactic monoids of fuzzy languages play a crucial role in the study. Varieties of fuzzy languages are introduced and an Eilenberg-type correspondence between varieties of fuzzy languages, varieties of ordinary languages and varieties of monoids is established.

Fuzzy tree automata are mathematical devices for modeling and analyzing vaguely defined structures. The behavior of a fuzzy automaton generates language by mapping set regular trees on ranked alphabet to membership values. It calculates the grade using rules that process their structural characteristics. This paper deals with constructing models satisfies given logical propositions (called prop...

in this paper, we de ne the concepts of general fuzzy recognizer, language recognized by a general fuzzy recognizer, the accessible and the coac- cessible parts of a general fuzzy recognizer and the reversal of a general fuzzy recognizer. then we obtain the relationships between them and construct a topology and some hypergroups on a general fuzzy recognizer.

Simulations and bisimulations between two fuzzy automata over a complete residuated lattice were defined by Ćirić et al. (2012) [7], [8] as relations the sets of states automata. However, they act crisp relationship In particular, if there exists (forward) bisimulation automata, then languages recognized them are crisply equal. Approximate simulations introduced Stanimirović (2022) [36] aim at ...

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 a project on runtime network monitoring based on predicate logic. We investigate closure properties of the class of recognizableMK-fuzzy languages accepted by MKfuzzy automat...

1. Introduction Cellular Automata have generated much interest [1,2,3] because of their diverse behavior and usefulness as a discrete model for many processes. Wolfram's 1984 paper on universality and complexity in cellular automata [3,4] described four classes of behavior for automata: class 1 for homogeneous stable behavior, class 2 for simple periodic patterns, class 3 for chaotic aperiodic ...