Finite codes and groupoid words (Q1178037): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 23:51, 29 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finite codes and groupoid words |
scientific article |
Statements
Finite codes and groupoid words (English)
0 references
26 June 1992
0 references
The author calls any element of the free magma constructed on some alphabet \(A\) groupoid word. Let us denote by \(\mathbb{N}\langle a,b\rangle\) the semiring of non-commutative polynomials with multiplicities in \(\mathbb{N}\) and over the two extra letters \(a\) and \(b\). A semiterm is an element of the free right semimodule \(A.\mathbb{N}\langle a,b\rangle\) over \(\mathbb{N}\langle a,b\rangle\) with \(A\) as a basis. This right semimodule is equipped with a magma operation defined by \(x\circ y=xa+yb\) for every \(x,y\in A.\mathbb{N}\langle a,b\rangle\). The author first recalls a classical necessary and sufficient condition for a semiterm to be a groupoid word, i.e. to belong to the submagma of \(A.\mathbb{N}\langle a,b\rangle\) generated by \(A\). A semiterm encodes in fact a set of trees and the author then shows that the semiterms which are groupoid words are exactly the semiterms encoding finite maximal prefix codes. The same kind of correspondence is given for entropic and cancellative entropic magmas where maximal commutatively prefix codes and finite maximal codes occur.
0 references
free magma
0 references
alphabet
0 references
semiring
0 references
free right semimodule
0 references
semiterms
0 references
groupoid words
0 references
finite maximal prefix codes
0 references
cancellative entropic magmas
0 references