Conjugacy relations of prefix codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 3745508 (Why is no real title available?)
- scientific article; zbMATH DE number 1738654 (Why is no real title available?)
- scientific article; zbMATH DE number 1932216 (Why is no real title available?)
- scientific article; zbMATH DE number 3350192 (Why is no real title available?)
- CONJUGACY IN FREE INVERSE MONOIDS
- Codes conjugués
- Codes et motifs
- Commutation with codes
- Conjugacy of finite biprefix codes
- LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
- On Conjugacy of Languages
- The Knuth-Bendix algorithm and the conjugacy problem in monoids.
- The power of commuting with finite sets of words
- Towards Decidability of Conjugacy of Pairs and Triples
Cited in
(7)- Conjugacy of a prefix code to a biprefix code
- scientific article; zbMATH DE number 4045195 (Why is no real title available?)
- scientific article; zbMATH DE number 4178784 (Why is no real title available?)
- Towards Decidability of Conjugacy of Pairs and Triples
- Conjugacy of finite biprefix codes
- Congruences, infix and cohesive prefix codes
- On Conjugacy of Languages
This page was built for publication: Conjugacy relations of prefix codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287447)