- lexicographical order
- лексикографический порядок
Большой англо-русский и русско-английский словарь. 2001.
lexicographical order
Смотреть что такое "lexicographical order" в других словарях:
Lexicographical order — In mathematics, the lexicographic or lexicographical order, (also known as lexical order, dictionary order, alphabetical order or lexicographic(al) product), is a generalization of the way the alphabetical order of words is based on the… … Wikipedia
Order — Contents 1 Ordinality 2 Philosophy 3 Science 4 Mathe … Wikipedia
Order (sort) — An order is a way of sorting entries, also called elements, in a list. The mathematical concept of linear order is closely related.* Chronological order mdash; listing by time, earliest to latest. (first, next, then, etc.) * Lexicographical order … Wikipedia
Total order — In set theory, a total order, linear order, simple order, or (non strict) ordering is a binary relation (here denoted by infix ≤) on some set X. The relation is transitive, antisymmetric, and total. A set paired with a total order is called a… … Wikipedia
Monomial order — In mathematics, a monomial order is a total order on the set of all (monic) monomials in a given polynomial ring, satisfying the following two properties: If u < v and w is any other monomial, then uw<vw. In other words, the ordering… … Wikipedia
Colexicographical order — In mathematics, the colexicographic or colex order, is a natural order structure of the Cartesian product of two or more ordered sets. It is similar in structure to the lexicographical order. Colexicographical ordering is used in the Kruskal… … Wikipedia
Product order — In mathematics, given two ordered sets A and B, one can induce a partial ordering on the Cartesian product A × B. Given two pairs (a1,b1) and (a2,b2) in A × B, one sets (a1,b1) ≤ (a2,b2) if and only if a1 ≤ a2 and b1 ≤ b2. This ordering is called … Wikipedia
Shortlex order — The shortlex (or radix, or length plus lexicographic) order is an ordering for ordered sets of objects, where the sequences are primarily sorted by cardinality (length) with the shortest sequences first, and sequences of the same length are… … Wikipedia
Dominance order — Example of dominance ordering of partitions of n. Here, n = 6, nodes are partitions of 6, edges indicate that the upper node dominates the lower node. While this particular partial ordering is graded, this is not true for the dominance ordering… … Wikipedia
On-Line Encyclopedia of Integer Sequences — URL oeis.org Created by Neil Sloane Launched 1996 ( … Wikipedia
String (computer science) — In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from a set or alphabet. In computer programming, a string is traditionally a sequence of… … Wikipedia
