Let L → H be a lattice homomorphism and let a “readable” drawing of H be given. It is natural to make use of it to try getting a clear(er) drawing of L. Hence, the following ...
: For the processing of decision making with uncertainty information, this paper establishes a decision model based on lattice-valued logic and researches the algorithm for extract...
In this paper, we illustrate a method to enumerate two-dimensional directed animals, with compact sources, on both the square and the triangular lattice. We give a recursive descr...
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, ...
— This work shows comparatively the capacity of five Fuzzy Lattice Neurocomputing (FLN) classifiers. The mechanics of the five classifiers are illustrated geometrically on the pl...
Al Cripps, Vassilis G. Kaburlasos, Nghiep Nguyen, ...
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...