Urutan leksikografik: Perbedaan antara revisi

The '''quasi-lexicographic order''' on the free monoid ''A''^&lowast; 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''^''n''.<ref>{{cite book | last=Calude | first=Cristian | authorlink=Cristian S. Calude | title=Information and randomness. An algorithmic perspective | series=EATCS Monographs on Theoretical Computer Science | publisher=[[Springer-Verlag]] | year=1994 | isbn=3-540-57456-5 | zbl=0922.68073 | page=1 }}</ref>