Codes and maximal monoids
From MaRDI portal
Cites work
- A note on renewal systems
- An Introduction to Symbolic Dynamics and Coding
- Codes and local constraints
- Codes and sofic constraints
- Complete Codes in a Sofic Shift
- Completing circular codes in regular submonoids
- Completing prefix codes in submonoids.
- Cyclic renewal systems
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
- scientific article; zbMATH DE number 3926268 (Why is no real title available?)
- scientific article; zbMATH DE number 3638132 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 2143015 (Why is no real title available?)
- Machines, Computations, and Universality
- On codes having no finite completions
- On some properties of very pure codes
- Systèmes codés. (Coded systems)
Cited in
(9)- Monoids and maximal codes
- scientific article; zbMATH DE number 3952655 (Why is no real title available?)
- scientific article; zbMATH DE number 4112802 (Why is no real title available?)
- scientific article; zbMATH DE number 1188994 (Why is no real title available?)
- scientific article; zbMATH DE number 1354855 (Why is no real title available?)
- Coding and strong coding in trace monoids
- Monomial-Cartesian codes closed under divisibility
- Decompositions of recognizable strong maximal codes
- Pseudo-cyclic renewal systems
This page was built for publication: Codes and maximal monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964399)