Urutan Leksikografis

Given a partially ordered set "A", the above considerations allow to define naturally a lexicographical partial order formula_14 over the free monoid "A"* formed by the set of all finite sequences of elements in "A", with sequence concatenation as the monoid operation, as follows: