Codes and maximal monoids
From MaRDI portal
Publication:964399
DOI10.1016/j.tcs.2010.01.035zbMath1191.68297OpenAlexW2092205976MaRDI QIDQ964399
Publication date: 15 April 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.035
Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items
Cites Work
- Codes and local constraints
- Cyclic renewal systems
- Systèmes codés. (Coded systems)
- On some properties of very pure codes
- A note on renewal systems
- On codes having no finite completions
- Completing circular codes in regular submonoids
- Codes and sofic constraints
- Completing prefix codes in submonoids.
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
- An Introduction to Symbolic Dynamics and Coding
- Complete Codes in a Sofic Shift
- Machines, Computations, and Universality
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Codes and maximal monoids
