Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
From MaRDI portal
Publication:1076166
DOI10.1016/0304-3975(85)90060-XzbMATH Open0593.20066OpenAlexW2041444507MaRDI QIDQ1076166FDOQ1076166
Michel Le Rest, Evelyne Barbin-Le Rest
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90060-x
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The (generalized) Post correspondence problem with lists consisting of two words is decidable
- Sur le calcul du monoide syntaxique d'un sous monoide finiment engendre
- Title not available (Why is that?)
Cited In (11)
- Binary codes that do not preserve primitivity
- Binary codes that do not preserve primitivity
- Finitary codes for biinfinite words
- Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words
- Word equations with \(k\)th powers of variables
- Title not available (Why is that?)
- The intersection of \(3\)-maximal submonoids
- A string-matching interpretation of the equation \(x^ m y^ n = z^ p\)
- Pseudo-solutions of word equations
- Binary equality words with two $b$'s
- Primitive sets of words
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 👍 👎
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)
