On lexicographic semi-commutations

doi:10.1016/0020-0190(87)90037-8

Information Processing Letters

Volume 26, Issue 2, 19 October 1987, Pages 55-59

https://doi.org/10.1016/0020-0190(87)90037-8 Get rights and content

Abstract

We give a characterization of the commutation graphs for which there exists a complete semi-commutation system. From which, we deduce a characterization of semi-commutation systems for which the set of minimal words and the set of irreducible words are equal.

Résumé

Dans cette article, nous caractérisons les graphes de commutation pour lesquels il existe un système de semi-commutation complet. Nous en déduisons une caractérisation des systèmes de semi-commutation pour lesquels l'ensemble des mots irréductibles est égal à l'ensemble des mots minimaux.

References (11)

IJ.J. Aalbersberg et al.
Theory of Traces
J. Berstel
Congruences plus que parfaites et langages algébriques
Séminaire d'Informatique Théorique de l'Institut de Programmation
(1976/1977)
P. Cartier et al.
Problèmes Combinatoires de Commutations et de Réarrangements
M. Clerbout et al.
Semi-commutations
R. Cori
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 Computation
In this work, we use rearrangements in rewriting positions sequence in order to study precisely the structure of the derivations in one-rule length-preserving string rewrite systems. That yields to the definition of a letter-to-letter transducer that computes the relation induced by a one-rule length-preserving string rewrite system. This transducer can be seen as an automaton over an alphabet $A \times A$ . We prove that this automaton is finite if and only if the corresponding relation is rational. We also identify a sufficient condition for the context-freeness of the language L recognized by this automaton and, when this condition is satisfied, we construct a pushdown automaton that recognizes L.
On confluent semi-commutations: Decidability and complexity results
1994, Information and Computation
The subject of this paper is the confluence of finite semi-commutation systems. Confluence of such systems is proved to be decidable property. Existence of a finite complete presentation of a trace monoid using rules only from another given trace monoid is proved to be reducible to the existence of a confluent semi-commutation system. Complexity results related to the preceding problems are proved: deciding the existence of finite complete presentations is Σ^P₂-complete, whereas deciding confluence of semi-commutation systems is Co-NP-complete. Additionally, an open problem about trace synchronizations is solved: The local checking property is Co-NP-complete.
Möbius functions and confluent semi-commutations
1993, Theoretical Computer Science
Dickert (1988) settled a well-known conjecture on unambiguous liftings to words of Möbius functions for free partially commutative monoids. He established thereby a new bridge from the theory of formal power series to the theory of complete semi-Thue systems. As an open question, it was asked whether this approach has a generalization to a relative situation where we do not lift to the free (word-) case but only to some level of less commutation. This question has been reconsidered by König (1992) and a conjecture has been formulated there. Our results solve the open problem and settle this conjecture (Remark 4.8).
We show that there is a canonical one-to-one correspondence between unambiguous Möbius functions and confluent semi-commutation systems (Theorem 5.1). This identification is due to some graph-theoretic characterizationobtained by Diekert (1991) and which allows one to apply some interesting complexity results (Section 6).
Our results can be viewed as a contribution to the combinatorial theory of Möbius functions and to the theory of rewriting on traces.
Semicommutations and algebraic algebraic
1992, Theoretical Computer Science
Rewriting, 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)

View all citing articles on Scopus

View full text

On lexicographic semi-commutations

Abstract

Résumé

Theory of Traces

Congruences plus que parfaites et langages algébriques

Séminaire d'Informatique Théorique de l'Institut de Programmation

Problèmes Combinatoires de Commutations et de Réarrangements

Semi-commutations

Partially Abelian Monoids