scientific article
From MaRDI portal
Publication:3737376
zbMath0601.94017MaRDI QIDQ3737376
Renato M. Capocelli, Christoph M. Hoffmann
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
prefix codeuniquely decipherable codedecipherability delayfinitely decipherable codesynchronizability delaysynchronizable code
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)
Related Items (4)
A fast algorithm for the unique decipherability of multivalued encodings ⋮ Automata for solid codes ⋮ Deciding whether a finite set of words has rank at most two ⋮ Locally complete sets and finite decomposable codes
This page was built for publication:
