On lexicographic semi-commutations (Q1108811): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Combinatorial problems of commutation and rearrangements / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Semi-commutations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recognizable subsets of some partially Abelian monoids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3725561 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3738586 / rank | |||
Normal rank | |||
Latest revision as of 17:59, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On lexicographic semi-commutations |
scientific article |
Statements
On lexicographic semi-commutations (English)
0 references
1987
0 references
We give a characterization of the communication graphs for which there exists a complete semi-commutation system. From this, we deduce a characterization of semi-commutation systems for which the set of minimal words and the set of irreducible words are equal.
0 references
commutation monoid
0 references
complete rewriting system
0 references
lexicographic order
0 references
trace
0 references
communication graphs
0 references
semi-commutation
0 references
