Urutan Leksikografis

If < is a total order on "A", then so is the lexicographic order < on "A"*. If "A" is a finite and totally ordered alphabet, "A"* is the set of all words over "A", and we retrieve the notion of dictionary ordering used in lexicography that gave its name to the lexicographic orderings.
However, in general this is not a well-order, even though it is on the alphabet "A"; for instance, if "A" = {"a", "b"}, the language {"a""b" | "n" ≥ 0} has no least element: ...< "aab" < "ab" < "b". A well-order for strings, based on the lexicographical order, is the shortlex order.