Strongly compatible total orders on free monoids (Q1179490)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strongly compatible total orders on free monoids |
scientific article; zbMATH DE number 24709
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly compatible total orders on free monoids |
scientific article; zbMATH DE number 24709 |
Statements
Strongly compatible total orders on free monoids (English)
0 references
26 June 1992
0 references
Strongly compatible orders on the free monoids \(X^*\) are considered here. It is shown that a strongly compatible order coincides with the lexicographic order if these orders are equal on all words of length three or less. Moreover, the strongly compatible orders for a binary alphabet are completely characterized.
0 references
free monoids
0 references
lexicographic order
0 references
strongly compatible orders
0 references
