Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
From MaRDI portal
(Redirected from Publication:1076166)
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.
Recommendations
- On two-weight \(\mathbb {Z}_{2^k}\)-codes
- On some topics in combinatorial coding theory
- On two-weight codes
- Duality of codes supported on regular lattices, with an application to enumerative combinatorics
- On maximality for some kinds of codes over two-letter alphabets
- On a kind of two-weight code
- Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability)
- On the Number of Two-Weight Cyclic Codes with Composite Parity-Check Polynomials
- On $Z_{2^k}$-Dual Binary Codes
- Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
Cites work
- scientific article; zbMATH DE number 3878385 (Why is no real title available?)
- scientific article; zbMATH DE number 3734202 (Why is no real title available?)
- scientific article; zbMATH DE number 3641729 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3350192 (Why is no real title available?)
- scientific article; zbMATH DE number 3407957 (Why is no real title available?)
- Sur le calcul du monoide syntaxique d'un sous monoide finiment engendre
- The (generalized) Post correspondence problem with lists consisting of two words is decidable
- The equation \(a_ M=b^ Nc^ P\) in a free group
Cited in
(15)- A string-matching interpretation of the equation x^ m y^ n = z^ p
- The intersection of 3-maximal submonoids
- Binary codes that do not preserve primitivity
- Pseudo-solutions of word equations
- Word equations with \(k\)th powers of variables
- Primitive sets of words
- Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words
- scientific article; zbMATH DE number 3958758 (Why is no real title available?)
- Finitary codes for biinfinite words
- Binary equality words with two b's.
- Binary codes that do not preserve primitivity
- Hardness results for constant-free pattern languages and word equations
- A note on pure codes
- Morphisms and BWT-run sensitivity
- Binary codes that do not preserve primitivity
This page was built for publication: Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076166)
