Note on compatible well orders on a free monoid

DOI10.1007/BF03025745zbMath0791.20065OpenAlexW2063876515MaRDI QIDQ1188318

Yuji Kobayashi

Publication date: 13 August 1992

Published in: Semigroup Forum (Search for Journal in Brave)

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

zbMATH Keywords

total orderstring rewritingpartial ordersfree monoidlength- sensitive compatible orders

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Ordered semigroups and monoids (06F05) Total orders (06A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Strongly compatible total orders on free monoids

This page was built for publication: Note on compatible well orders on a free monoid