Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes) (Q1076166)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes) |
scientific article; zbMATH DE number 3953100
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes) |
scientific article; zbMATH DE number 3953100 |
Statements
Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes) (English)
0 references
1985
0 references
Two element codes \(X=\{x,y\}\) are studied, that is, subsets X of a free monoid \(A^*\) which generate a free submonoid \(X^*\). It is shown that if a long enough word w in \(X^*\) has two disjoint X-interpretations then w is a factor of \(x^ n\) or \(y^ n\) or w is a power of \(x^ ny\) or \(xy^ n\) for some n. By disjoint X-interpretations we mean that the word w has two ''covers'' in \(X^*\) such that these covers have no common cut points inside w.
0 references
Two element codes
0 references
free monoid
0 references
X-interpretations
0 references
0 references
0.8349549
0 references
0.82180256
0 references
0.8215734
0 references
0 references
0.81718546
0 references
0.8148442
0 references
0 references