Search Results for ""

A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...

A system in which words (expressions) of a formal language can be transformed according to a finite set of rewrite rules is called a reduction system. While reduction systems ...

R(X_1,...X_n)=sum_(i=1)^nH(X_i)-H(X_1,...,X_n), where H(x_i) is the entropy and H(X_1,...,X_n) is the joint entropy. Linear redundancy is defined as ...

Given a module M over a commutative unit ring R and a filtration F:... subset= I_2 subset= I_1 subset= I_0=R (1) of ideals of R, the Rees module of M with respect to F is ...

Given a commutative unit ring R and a filtration F:... subset= I_2 subset= I_1 subset= I_0=R (1) of ideals of R, the Rees ring of R with respect to F is R_+(F)=I_0 direct sum ...

A reference triangle is a triangle relative to which trilinear coordinates, exact trilinear coordinates, derived triangle, or other objects are defined in triangle geometry ...

The reflection circle, a term coined here for the first time, is the circumcircle of the reflection triangle. It has center at Kimberling center X_(195), which is the ...

A reflection relation is a functional equation relating f(-x) to f(x), or more generally, f(a-x) to f(x). Perhaps the best known example of a reflection formula is the gamma ...

Let X be a normed space and X^(**)=(X^*)^* denote the second dual vector space of X. The canonical map x|->x^^ defined by x^^(f)=f(x),f in X^* gives an isometric linear ...

An idealized computing machine consisting of a fixed set of data registers and set of instructions for operating on them. Register machines are also known as counter machines ...