Strongly compatible total orders on free monoids

DOI10.1007/BF02574278MaRDI QIDQ1179490zbMATH OpenOpenAlexFDO

Authors S. Singh

Publication date 26 June 1992

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/135122

zbMATH Keywords

free monoidslexicographic orderstrongly compatible orders

Mathematics Subject Classification ID

Ordered semigroups and monoids (06F05) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Combinatorics on words (68R15)

Review text

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.

Recommendations

• Note on compatible well orders on a free monoid
• scientific article; zbMATH DE number 758015
• scientific article; zbMATH DE number 3987346
• Shuffle-compatible total orders
• scientific article; zbMATH DE number 3854451

Cited in

(7)

• Shuffle-compatible total orders
• Note on compatible well orders on a free monoid
• Weights for total division orderings on strings
• scientific article; zbMATH DE number 3987346 (Why is no real title available?)
• Scott's conjecture is true, position sensitive weights
• scientific article; zbMATH DE number 758015 (Why is no real title available?)
• Weight ideals associated to regular and log-linear arrays.

This page was built for publication: Strongly compatible total orders on free monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179490)