Professional Documents
Culture Documents
Cse 213 Orders
Cse 213 Orders
,
where is an alphabet (i.e., a nite set).
Let be a partial order on .
The lexicographic relation
L
on
is dened by:
x y if and only if either x is a proper prex
of y or else x and y have a longest common
prex u such that x = uv and y = uw and the
rst symbol of v is a predecessor of the rst
symbol of w (with respect to the partial order
on ).
The arrangement of words in a dictionary is one example
of a lexicographic order, and these orders are therefore
also called dictionary orders.
For example, let be the set a, b with partial order
a b. Then aa
L
ab and aa
L
b.
Theorem.
1. The relations
L
are partial orders.
2. If (, ) is a totally ordered set, so is (
,
L
).
In this order there are innite ascending chains, e.g.,
L
a
L
aa
L
aaa
L
as well as innite descending chains, e.g.,
b ~
L
ab ~
L
aab ~
L
aaab ~
L
. . .
Thus, the set of strings a
n
b : n N has no minimal
element.
Standard Order on Strings
Let be an alphabet and be a partial order on .
The standard order
S
on
is dened by:
x
S
y if and only if either [x[ < [y[ or else
[x[ = [y[ and x
L
y.
In other words, strings are compared rst according to
length and then lexicographically.
For example, let be the set a, b with partial order
a b. We have aa
S
ab
S
ba
S
bb. There are innite
ascending chains, e.g.,
S
a
S
b
S
aa
S
bb
S
aaa
S
but no innite descending chains.
Theorem.
1. The relations
S
are partial orders.
2. If is a total order on , then
S
is a total order
on