A Poset Classifying Non-Commutative Term Orders
We study a poset $\Re$ on the free monoid (X*) on a countable alphabet X.This poset is determined by the fact that its total extensions are precisely the standard term orders on X*. We also investigate the poset classifying degree-compatible standard term orders, and the poset classifying sorted ter...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2001-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/2286/pdf |