Search Results for ""
601 - 610 of 1349 for Deterministic Finite State MachineSearch Results
A number that is "close" to (but not equal to) zero may be called an almost zero. In contrast, a number or expression that is equal to zero is said to be identically zero. ...
A Banach space X has the approximation property (AP) if, for every epsilon>0 and each compact subset K of X, there is a finite rank operator T in X such that for each x in K, ...
A general reciprocity theorem for all orders which covered all other known reciprocity theorems when proved by E. Artin in 1927. If R is a number field and R^' a finite ...
The word basis can arise in several different contexts. Speaking in general terms, an object is "generated" by a basis in whatever manner is appropriate. For example, a ...
A sequence of polynomials p_n satisfying the identities p_n(x+y)=sum_(k>=0)(n; k)p_k(x)p_(n-k)(y).
Given the functional (1) find in a class of arcs satisfying p differential and q finite equations phi_alpha(y_1,...,y_n;y_1^',...,y_n^')=0 for alpha=1,...,p ...
An occurrence of a variable in a logic which is not free. Bound variables are also called dummy variables.
The number of "prime" boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.
A finite, increasing sequence of integers {a_1,...,a_m} such that (a_i-1)|(a_1...a_(m-1)) for i=1, ..., m, where m|n indicates that m divides n. A Carmichael sequence has ...
In mathematics, a cell is a finite regular polytope.
...
View search results from all Wolfram sites (161092 matches)

