Urutan Leksikografis

Consider the set of functions "f" from a well-ordered set "X" to a totally ordered set "Y". For two such functions "f" and "g", the order is determined by the values for the smallest "x" such that "f"("x") ≠ "g"("x").