On lexicographic semi-commutations
References (11)
- et al.
Theory of Traces
Congruences plus que parfaites et langages algébriques
Séminaire d'Informatique Théorique de l'Institut de Programmation
(1976/1977)- et al.
Problèmes Combinatoires de Commutations et de Réarrangements
- et al.
Semi-commutations
Partially Abelian Monoids
There are more references available in the full text version of this article.
Cited by (7)
A canonical automaton for one-rule length-preserving string rewrite systems
2015, Information and ComputationOn confluent semi-commutations: Decidability and complexity results
1994, Information and ComputationMöbius functions and confluent semi-commutations
1993, Theoretical Computer ScienceSemicommutations and algebraic algebraic
1992, Theoretical Computer ScienceRewriting, möbius functions and semi-commutations
1993, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)On confluent semi-commutations-decidability and complexity results
1991, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1987 Published by Elsevier B.V.