In this paper we introduce the Max-Min intuitionistic fuzzy matrix M (G) of an intuitionistic fuzzy graph. And the extreme energy of M (G) is defined. And also we give the explicit expression for the coefficients of the characteristic polynomial of M (G) . These concepts are illustrated with real time example. AMS Subject Classification: 03E72, 05C50

In this paper, single and multi container maintenance model under limited time interval of interest is introduced in fuzzy environment. These fuzzy models are solved by fuzzy geometric programming technique. Here fuzzy geometric programming is discussed through fuzzy decision-making processes with three different operators, max-min, max-average mean, and max-geometric mean. These operators are ...

In this paper, at first, we define the notion of general fuzzy automaton over a field; call vector (VGFA). Moreover, present concept max-min automaton. We show that if two VGFA are similar, they constitute an isomorphism. After that, prove isomorphism with threshold α, equivalent where $\alpha \in [0,1]$. Also, some examples given to clarify these new notions.

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

It is well known that a conventional feedforward neural network always has bias terms, which is necessary for it to solve classification or approximation problems. But for fuzzy neural networks (FNNs), it seems not quite clear yet whether the bias is dispensable or not. Some authors introduce the bias, while the others do not. This note tries to partly answer this question for two simple buildi...