scientific article
From MaRDI portal
Publication:3416096
zbMath1106.68062MaRDI QIDQ3416096
Publication date: 19 January 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
wordscompletenessdensityrankfree monoidlocal densityweakly completeminimal automatonsubmonoidvariable length codecompletablecompletion of a codestrongly thin
Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)
Related Items (4)
On the maximality of languages with combined types of code properties ⋮ When variable-length codes meet the field of error detection ⋮ Topologies for error-detecting variable-length codes ⋮ Completing circular codes in regular submonoids
This page was built for publication: