Search Results for ""
101 - 110 of 1349 for Deterministic Finite State MachineSearch Results
View search results from all Wolfram sites (161092 matches)Theory of Computation
Some interesting properties (as well as a few arcane ones not reiterated here) of the number 239 are discussed in Schroeppel (1972). 239 appears in Machin's formula ...
A simple point process (or SPP) is an almost surely increasing sequence of strictly positive, possibly infinite random variables which are strictly increasing as long as they ...
The mathematical study of abstract computing machines (especially Turing machines) and the analysis of algorithms used by such machines. A connection between automata theory ...
"Aggregate" is an archaic word for infinite sets such as those considered by Georg Cantor. The term is sometimes also used to refer to a finite or infinite set in which ...
A topology defined on a totally ordered set X whose open sets are all the finite intersections of subsets of the form {x in X|x>a} or {x in X|x<a}, where a in X. The order ...
An infinite set, such as the real numbers, which is not countably infinite.
In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a floating-point representation is an unencoded member of a floating-point format which represents either ...
A solvable group is a group having a normal series such that each normal factor is Abelian. The special case of a solvable finite group is a group whose composition indices ...
The Burnside problem originated with Burnside (1902), who wrote, "A still undecided point in the theory of discontinuous groups is whether the group order of a group may be ...
...