Search Results for ""
581 - 590 of 1349 for Deterministic Finite State MachineSearch Results
A version of set theory which is a formal system expressed in first-order predicate logic. Zermelo-Fraenkel set theory is based on the Zermelo-Fraenkel axioms. ...
A group G is a finite or infinite set of elements together with a binary operation (called the group operation) that together satisfy the four fundamental properties of ...
In common usage, an ordinal number is an adjective which describes the numerical position of an object, e.g., first, second, third, etc. In formal set theory, an ordinal ...
The symmetric group S_n of degree n is the group of all permutations on n symbols. S_n is therefore a permutation group of order n! and contains as subgroups every group of ...
An Abelian group is a group for which the elements commute (i.e., AB=BA for all elements A and B). Abelian groups therefore correspond to groups with symmetric multiplication ...
Vassiliev invariants, discovered around 1989, provided a radically new way of looking at knots. The notion of finite type (a.k.a. Vassiliev) knot invariants was independently ...
Fuglede (1974) conjectured that a domain Omega admits an operator spectrum iff it is possible to tile R^d by a family of translates of Omega. Fuglede proved the conjecture in ...
The Hadwiger number of a graph G, variously denoted eta(G) (Zelinka 1976, Ivančo 1988) or h(G) (Stiebitz 1990), is the number of vertices in the largest complete minor of G ...
Homology is a concept that is used in many branches of algebra and topology. Historically, the term "homology" was first used in a topological sense by Poincaré. To him, it ...
The Pierce expansion, or alternated Egyptian product, of a real number 0<x<1 is the unique increasing sequence {a_1,a_2,...} of positive integers a_i such that ...
...
View search results from all Wolfram sites (161092 matches)

