Pages that link to "Item:Q1076166"

The following pages link to Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes) (Q1076166):

Displayed 10 items.

• A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) (Q1190459) ‎ (← links)
• The intersection of \(3\)-maximal submonoids (Q2067614) ‎ (← links)
• Binary codes that do not preserve primitivity (Q2104527) ‎ (← links)
• Pseudo-solutions of word equations (Q2304544) ‎ (← links)
• Word equations with \(k\)th powers of variables (Q2424902) ‎ (← links)
• Primitive sets of words (Q2662680) ‎ (← links)
• Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words (Q2799193) ‎ (← links)
• Finitary codes for biinfinite words (Q4020493) ‎ (← links)
• Binary equality words with two $b$'s (Q4683346) ‎ (← links)
• Binary codes that do not preserve primitivity (Q6111526) ‎ (← links)