The commutation with codes and ternary sets of words
From MaRDI portal
Recommendations
Cited in
(17)- Commutation with ternary sets of words
- Conway's problem for three-word sets.
- On the proportion of prefix codes in the set of three-element codes
- Commutation with codes
- The power of commuting with finite sets of words
- Conway's problem and the commutation of languages.
- On the centralizer of a finite set
- Codes et motifs
- scientific article; zbMATH DE number 3936538 (Why is no real title available?)
- scientific article; zbMATH DE number 1522559 (Why is no real title available?)
- scientific article; zbMATH DE number 2155196 (Why is no real title available?)
- scientific article; zbMATH DE number 3895249 (Why is no real title available?)
- Commutation of Binary Factorial Languages
- On a conjecture about commuting codes
- On the complexity of decidable cases of the commutation problem of languages
- scientific article; zbMATH DE number 7731171 (Why is no real title available?)
- Three-element codes with one \(d\)-primitive word
This page was built for publication: The commutation with codes and ternary sets of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418638)