TOPICS
Search

Search Results for ""


951 - 960 of 1349 for Deterministic Finite State MachineSearch Results
A closed interval corresponding to a finite portion of an infinite line. Line segments are generally labeled with two letters corresponding to their endpoints, say A and B, ...
There are at least two distinct notions of linear space throughout mathematics. The term linear space is most commonly used within functional analysis as a synonym of the ...
Let P be a class of (universal) algebras. Then an algebra A is a local P-algebra provided that every finitely generated subalgebra F of A is a member of the class P. Note ...
A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...
The Lyapunov condition, sometimes known as Lyapunov's central limit theorem, states that if the (2+epsilon)th moment (with epsilon>0) exists for a statistical distribution of ...
A sequence of random variates X_0, X_1, ... with finite means such that the conditional expectation of X_(n+1) given X_0, X_1, X_2, ..., X_n is equal to X_n, i.e., ...
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and is a meet-homomorphism, then h is a meet-embedding.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A meet-endomorphism of L is a meet-homomorphism from L to L.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a meet-homomorphism if h(x ^ y)=h(x) ^ h(y). It is also said that "h preserves meets."
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a meet-isomorphism provided that it preserves meets.
1 ... 93|94|95|96|97|98|99 ... 135 Previous Next

...