Syntactic recognizability of graphs with fuzzy attributes

We present a syntactic recognition theory for graphs with fuzzy edges and fuzzy nodes by employing the algebraic structure of magmoids. Several examples are illustrated and it is proved that the α-cut of a recognizable set of fuzzy graphs is not always recognizable as a set of crisp graphs. The described theory is then applied for the recognition of fuzzy cognitive maps and the recognizability of interesting examples of sets of fuzzy cognitive maps is examined.