Function distinguishable languages were introduced as a new methodology of defining characterizable subclasses of the regular languages which are learnable from text. Here, we give details on the implementation and the analysis of the corresponding learning algorithms. We also discuss problems which might occur in practical applications.

‎This paper deals with one problem that needs to be addressed in the emerging field known under the name computing with perceptions‎. ‎It is the problem of describing‎, ‎approximately‎, ‎a given fuzzy set in natural‎ ‎language‎. ‎This problem has lately been referred to as the problem of retranslation‎. ‎An approaches to ‎dealing with the retranslation problem is discussed in the paper‎, ‎that ...

in this paper, we investigate various kinds of extensions of twin-good rings. moreover, we prove that every element of an abelian neat ring r is twin-good if and only if r has no factor ring isomorphic to z2  or z3. the main result of [24] states some conditions that any right self-injective ring r is twin-good. we extend this result to any regular baer ring r by proving that every element of a...