A Poset Classifying Non-Commutative Term Orders

Abstract : 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 term orders. For the latter poset, we give a Galois coconnection with the Young lattice.
Type de document :
Communication dans un congrès
Cori, Robert and Mazoyer, Jacques and Morvan, Michel and Mosseri, Rémy. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001), pp.301-314, 2001, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01182966
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 6 août 2015 - 11:28:03
Dernière modification le : mardi 7 mars 2017 - 15:00:10
Document(s) archivé(s) le : vendredi 5 mai 2017 - 11:23:26

Fichier

dmAA0122.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01182966, version 1

Collections

Citation

Jan Snellman. A Poset Classifying Non-Commutative Term Orders. Cori, Robert and Mazoyer, Jacques and Morvan, Michel and Mosseri, Rémy. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001), pp.301-314, 2001, DMTCS Proceedings. 〈hal-01182966〉

Partager

Métriques

Consultations de la notice

65

Téléchargements de fichiers

88