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

‘Occurrence’ denotes a perceived element of a spatiotemporal development. In many languages, for example in English and German, occurrences correspond to verbphrases. We converted programmed recognition automata for German occurrence representations related to road traffic scenes into English occurrence specifications suitable for manipulation by a Fuzzy Metric-Temporal Horn Logic (FMTHL) infer...

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.

We generalize the previous results that were obtained by Kohout for relations based on fuzzy Basic Logic systems (BL) of Hájek and also for relational systems based on left-continuous tnorms. The present paper extends generalized morphisms into the realm of Monoidal Fuzzy Logics by first proving and then using relational inequalities over pseudo-associative BK-products of relations in these log...