Commutation with codes
From MaRDI portal
Publication:2484442
Recommendations
Cites work
- Centralizers in Free Associative Algebras
- Challenges of commutation. An advertisement
- Codes conjugués
- Codes et motifs
- Commutation with ternary sets of words
- Conway's problem for three-word sets.
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3745508 (Why is no real title available?)
- scientific article; zbMATH DE number 3623772 (Why is no real title available?)
- scientific article; zbMATH DE number 709438 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2155196 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1836425 (Why is no real title available?)
- scientific article; zbMATH DE number 3239597 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- On the centralizer of a finite set
- On the decomposition of finite languages
- Regular solutions of language inequalities and well quasi-orders
- The branching point approach to Conway's problem
- The commutation of finite sets: A challenging problem
- The power of commuting with finite sets of words
Cited in
(16)- Conjugacy of finite biprefix codes
- Commutation with ternary sets of words
- Conway's problem for three-word sets.
- Language equations
- Simple equations on binary factorial languages
- Playing with Conway's problem
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
- On the centralizer of a finite set
- Conjugacy relations of prefix codes
- Sub-classes of the monoid of left cancellative languages
- Codes et motifs
- Communication code generation in systems of affine recurrence equations
- On the simplest centralizer of a language
- The commutation with codes and ternary sets of words
- scientific article; zbMATH DE number 2155196 (Why is no real title available?)
- A free monoid containing all prefix codes
This page was built for publication: Commutation with codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484442)