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

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

In this paper intuitionistic fuzzy pushdown automata, acceptance by empty stack and acceptance by final states and their equivalence is proved. It follows that intuitionistic fuzzy pushdown automata with empty stack and IFPDAs are equivalent. We propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs), intuitionistic fuzzy languages generated by IFCFGs. Additionally, we introd...

in this note first by considering the notion of general fuzzy automata (for simplicity gfa), we define the notions of direct product, restricted direct product and join of two gfa. also, we introduce some operations on (fuzzy) sets and then prove some related theorems. finally we construct the general fuzzy recognizers and recognizable sets and give the notion of (trim) reversal of a given gfa....

Microscopic traffic models have recently gained considerable importance as a mean of optimising traffic control strategies. Computationally efficient and sufficiently accurate microscopic traffic models have been developed based on the cellular automata theory. However, the real-time application of the available cellular automata models in traffic control systems is a difficult task due to thei...