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

This paper discusses the property of local finiteness for t-norm monoids and extensions of them. The focus is (i) on t-norm bimonoids, which are of interest in the context of weighted automata, (ii) on those extensions of t-norm monoids which are reducts of t-algebras, i.e. of the basic semantic entities for the (fuzzy) logics of left-continuous and of continuous t-norms, and (iii) on extension...

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