General automata are considered with respect to normal-ization over semirings. Possibilistic automata are deened as normal pessimistic fuzzy automata. Possibilistic automata are analogous to stochas-tic automata where stochastic (+=) semirings are replaced by possi-bilistic (_=^) semirings; but where stochastic automata must be normal, fuzzy automata may be (resulting in possibilistic automata)...

in this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $nondeterministic$ $fuzzy$$finite$ $tree$ $automata$ (nffta). initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). inorder to eliminate these limitations and increasing theefficiency of ffta, we defin...

In this paperwe adapt thewell-knownBrzozowskideterminizationmethod to fuzzy automata. Thismethod gives better results than all previously knownmethods for determinization of fuzzy automata developed by Bělohlávek [InformSciences 143 (2002)205–209],Li andPedrycz [FuzzySet Syst 156 (2005)68–92], Ignjatović et al. [Inform Sciences 178 (2008) 164–180], and Jančić et al. [Inform Sciences 181 (2011) ...

Automata are the prime example of general computational systems over discrete spaces. The incorporation of fuzzy logic into automata theory resulted in fuzzy auotomata which can handle continuous spaces. Moreover, they are able to model uncertainty which is inherent in many applications. Deterministic Finite-state Automata (DFA) have been the architecture, most used in many applications, but, t...

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

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

In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...

In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

There are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as automata, labeled transition systems, Kripke models interpretations in description logics. Fuzzy bisimulations automata over a complete residuated lattice have been introduced by ?iri? et al. 2012. Logical characterizations (respectively, logics) the [0,1] with Gödel t-norm provided Fan 2015 Nguyen 202...