Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)

DOI10.1016/0304-3975(85)90060-XzbMath0593.20066OpenAlexW2041444507MaRDI QIDQ1076166

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

zbMATH Keywords

free monoidTwo element codesX-interpretations

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (10)

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

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)