Urutan Leksikografis

The quasi-lexicographic order on the free monoid "A" over an ordered alphabet "A" orders strings firstly by length, so that the empty string comes first, and then within strings of fixed length "n", by lexicographic order on "A".