it is well known fact that binary relations are generalized mathematical functions. contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. some basic operations on functions such as the inverse and composition are applicable to binary relations as well. depending on the domain or range or both are fuzzy value fuzzy set, i...

We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over partially reflexive forests. We obtain a complexity-theoretic dichotomy: QCSP(H) is either in NL or is NP-hard. The separating condition is related firstly to connectivity, and thereafter to accessibility from all vertices of H to connected reflexive subgraphs. In the case of partially reflexive paths...

The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...

1. Introduction This study provides a computer-simulated optimal selection of antecedent of reflexive pronouns based on the Visual C++ computer programming language. The algorithm that I use for this implementation is based on the optimal theoretic approach to the proper interpretation of reflexive pronoun roughly adopted in Moon (1999). I show that the complex behavior of reflexive pronouns ca...

(including the generalized coupled Sylvester matrix equations as special cases) have numerous applications in control and system theory. In this paper, an iterative algorithm is constructed to solve the general coupled matrix equations and their optimal approximation problem over generalized reflexive matrix solution (X1,X2, . . . ,Xq). When the general coupled matrix equations are consistent o...

Although much is known about volitional and reflexive smooth eye movements individually, much less is known about how they are coordinated. It is hypothesized that separate cortico-ponto-cerebellar loops subserve these different types of smooth eye movements. Specifically, the MT-MST-DLPN pathway is thought to be critical for ocular following eye movements, whereas the FEF-NRTP pathway is under...

A reflexive graph is a simple undirected graph where a loop has been added at each vertex. If G and H are reflexive graphs and U ⊆ V (H), then a vertex map f : U → V (G) is called nonexpansive if for every two vertices x, y ∈ U , the distance between f(x) and f(y) in G is at most that between x and y in H . A reflexive graph G is said to have the extension property (EP) if for every reflexive g...

In two recent papers [9, 10] we answered a question raised in the book by Eklof and Mekler [7, p. 455, Problem 12] under the set theoretical hypothesis of ♦א1 which holds in many models of set theory, respectively of the special continuum hypothesis (CH). The objects are reflexive modules over countable principal ideal domains R, which are not fields. Following H. Bass [1] an R-module G is refl...

Recent behavioral data have shown that central nonpredictive gaze direction triggers reflexive shifts of attention toward the gazed-at location (e.g., Friesen & Kingstone, 1998). Friesen and Kingstone suggested that this reflexive orienting effect is unique to biologically relevant stimuli. Three experiments were conducted to test this proposal by comparing the attentional orienting produced by...

The concept of σ-reflexive semigroups is due to Chacron and Thierrin in 1972. In the present paper we discuss σ-reflexive semigroups with apartness. We prove some fundamental properties of these semigroups.