A three-word code which is not prefix-suffix composed
From MaRDI portal
Publication:671357
DOI10.1016/0304-3975(95)00139-5zbMath0874.68169MaRDI QIDQ671357
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00139-5
\(n\)-word code; codes having finite completion; codes having no finite completion; finite \(p\)-\(s\)-composed codes; finite prefix-suffix composed code
68R15: Combinatorics on words
68Q45: Formal languages and automata
94A45: Prefix, length-variable, comma-free codes
Related Items
An application of Hajós factorizations to variable-length codes, A first step in characterizing three-element codes, On the proportion of prefix codes in the set of three-element codes, On a complete set of operations for factorizing codes
Cites Work