On lexicographic semi-commutations (Q1108811): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90037-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034001113 / rank | |||
Normal rank | |||
Revision as of 01:31, 20 March 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
