Completing prefix codes in submonoids.
From MaRDI portal
Publication:2490823
DOI10.1016/j.tcs.2006.01.027zbMath1093.94020OpenAlexW2068469059MaRDI QIDQ2490823
Publication date: 18 May 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.027
decidabilityvariable length codesprefix codeformal languagemonoidregular codescompletion of codessubmonoid
Combinatorics on words (68R15) Formal languages and automata (68Q45) Algebraic combinatorics (05E99) Prefix, length-variable, comma-free codes (94A45)
Related Items (3)
On the maximality of languages with combined types of code properties ⋮ Completing circular codes in regular submonoids ⋮ Codes and maximal monoids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prefix-free languages as \(\omega\)-generators
- Systèmes codés. (Coded systems)
- Finitely generated \(\omega\)-languages
- Finitely generated sofic systems
- A universal algorithm for sequential data compression
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
- Machines, Computations, and Universality
This page was built for publication: Completing prefix codes in submonoids.
