In [To], the author presented a method of constructing all weakly regular pseudospherical surfaces corresponding to given Weierstrass-type data. While the construction itself will appear later as a separate publication, this report contains a complete and detailed description of the Weierstrass representation for weakly regular surfaces with K = −1, in terms of moving frames and loop groups. Ma...

We show that each R-module is n-flat (resp., weakly n-flat) if and only if R is an (n,n− 1)-ring (resp., a weakly (n,n− 1)-ring). We also give a new characterization of n-von Neumann regular rings and a characterization of weak n-von Neumann regular rings for (CH)-rings and for local rings. Finally, we show that in a class of principal rings and a class of local Gaussian rings, a weak n-von Neu...

Let M be a submonoid of the free monoid A∗, and let X ⊆ M be a variable length code (for short a code). X is weakly M-complete if any word in M is a factor of some word in X∗ [J. Néraud, C. Selmi, Free monoid theory: maximality and completeness in arbitrary submonoids, Internat. J. Algorithms Comput. 13(5) (2003) 507–516]. Given a code X ⊆ M , we are interested in the construction of a weakly M...

In [17], two of the authors have introduced techniques to build agents on top of arbitrary data structures, and to “agentize” new/existing programs. They provided a series of successively more sophisticated semantics for such agent systems, and showed that as these semantics become epistemically more desirable, a computational price may need to be paid. In this paper, we identify a class of age...

In this paper, we will define a new class of sets, called fuzzy neutrosophic weakly- generalized closed then proved some theorems related to definition. After that, studied relations between weakly-generalized sets and α regular pre semi sets.